The axiomatization problem of a theory of linear languages

  • G. Wechsung
Formal Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 28)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. (1).
    GRUSKA, J. A characterization of context-free languages. Journal Comput. Syst. Sci. 5 (1971), 353–364.Google Scholar
  2. (2).
    KLEENE, S. C. Representation of events in nerve-nets and finite automata. Automata Studies, Princeton, 1956, 3–41.Google Scholar
  3. (3).
    SALOMAA, A. Two complete axiom systems for the algebra of regular events. JACM 13, Nr. 1 (January 1966), 158–169.Google Scholar
  4. (4).
    MCWHIRTER, J. P. Substitution expressions. Journal Comput. Syst. Sci. 5 (1971), 629–673.Google Scholar
  5. (5).
    YNTEMA, M. K. Cap expressions for context-free languages. Information and Control 18 (1971), 311–318.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • G. Wechsung
    • 1
  1. 1.Sektion Mathematik der Friedrich-Schiller-Universität Jena69 JenaDDR

Personalised recommendations