An algebraic formulation of the Chomsky hierarchy
- 1 January 1975
- book chapter
- Published by Springer Nature
- p. 209-213
- https://doi.org/10.1007/3-540-07142-3_84
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An unusual application of program-provingPublished by Association for Computing Machinery (ACM) ,1973
- Mappings and grammars on treesTheory of Computing Systems, 1970
- Full AFLs and nested iterated substitutionInformation and Control, 1970
- Tree generating regular systemsInformation and Control, 1969
- Deductive systems and categories II. Standard constructions and closed categoriesLecture Notes in Mathematics, 1969
- Grammars with macro-like productionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1968
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theoryJournal of Computer and System Sciences, 1967
- On certain formal properties of grammarsInformation and Control, 1959