Preview
Unable to display preview. Download preview PDF.
References
Brainerd, W.S., Tree Generating Regular Systems, Information and Control 14 (1969) 217–231.
Chomsky, N., On certain formal properties of grammars, Information and Control 2: 2 (1959), 137–167.
Fischer, M.J., Grammars with Macro-Like Productions, Proc 9th IEEE Conf Sw & Auto Th (1968), 131–142.
Greibach, S.A., Full AFL and Nested Iterated Substitution, Information and Control 16 (1970), 7–35.
Lambek J., Deductive Systems & Categories II, Category Theory, Homology Theory & Their Applications I (P. Hilton, ed.) Berlin: Springer-Verlag, Lecture Notes in Mathematics, Vol. 86, (1969), 76–122.
Rounds, W. C., Mappings and Grammars on Trees, Math Sys Th 4 (1970), 257–287.
Scott, D. The Lattice of Flow Diagrams, Oxford U. Comp. Lab. Rep. PRG-3 (1970).
Thatcher, J. W., Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory, J Comp & Sys Sci 1 (1967), 317–322.
Wand, M. An Usual Application of Program-Proving Proc 5th ACM Symp on Th of Computing (Austin, 1973), 59–66.
Wand, M. Algebraic Foundations of Formal Language Theory, MIT Project MAC TR-108, Cambridge, Mass., 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wand, M. (1975). An algebraic formulation of the Chomsky hierarchy. In: Manes, E.G. (eds) Category Theory Applied to Computation and Control. Lecture Notes in Computer Science, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07142-3_84
Download citation
DOI: https://doi.org/10.1007/3-540-07142-3_84
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07142-6
Online ISBN: 978-3-540-37426-8
eBook Packages: Springer Book Archive