Advertisement

An algebraic formulation of the Chomsky hierarchy

  • Mitchell Wand
Submitted Abstract
Part of the Lecture Notes in Computer Science book series (LNCS, volume 25)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Brainerd, W.S., Tree Generating Regular Systems, Information and Control 14 (1969) 217–231.CrossRefMathSciNetGoogle Scholar
  2. 2.
    Chomsky, N., On certain formal properties of grammars, Information and Control 2: 2 (1959), 137–167.CrossRefMathSciNetGoogle Scholar
  3. 3.
    Fischer, M.J., Grammars with Macro-Like Productions, Proc 9th IEEE Conf Sw & Auto Th (1968), 131–142.Google Scholar
  4. 4.
    Greibach, S.A., Full AFL and Nested Iterated Substitution, Information and Control 16 (1970), 7–35.CrossRefMathSciNetGoogle Scholar
  5. 5.
    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.CrossRefGoogle Scholar
  6. 6.
    Rounds, W. C., Mappings and Grammars on Trees, Math Sys Th 4 (1970), 257–287.CrossRefMathSciNetGoogle Scholar
  7. 7.
    Scott, D. The Lattice of Flow Diagrams, Oxford U. Comp. Lab. Rep. PRG-3 (1970).Google Scholar
  8. 8.
    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.MathSciNetGoogle Scholar
  9. 9.
    Wand, M. An Usual Application of Program-Proving Proc 5th ACM Symp on Th of Computing (Austin, 1973), 59–66.Google Scholar
  10. 10.
    Wand, M. Algebraic Foundations of Formal Language Theory, MIT Project MAC TR-108, Cambridge, Mass., 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Mitchell Wand
    • 1
  1. 1.Computer Science DepartmentIndiana UniversityBloomingtonUSA

Personalised recommendations