Die Darstellung indizierter Sprachen durch Ausdrücke

  • O. Mayer
Formale Sprachen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2)


Alphabet Versus Complete Axiom System Irregular Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    AHO, A.V. (1968): Indexed grammars — an extension of context-free grammars. J.ACM 15, 647–671.Google Scholar
  2. 2.
    BRZOZOWSKI, J.A. (1968): Regular-Like Expressions for Some Irregular Languages. IEEE Conf. Record of 9th Ann. Symp. on Switching and Automata Theory, 278–286.Google Scholar
  3. 3.
    CREMERS, A.B. (1973a): Kleene-Algebren formaler Ausdrücke. Erscheint in Ann. Acad. Scient. Fennicae.Google Scholar
  4. 4.
    CREMERS, A.B. (1973b): Non-Sequential Languages. Erscheint in Inform. Contr. 24, (Sept. 1973).Google Scholar
  5. 5.
    GRUSKA, J. (1971): A Characterization of Context-Free Languages. J. Comp. Sys. Sci. 5, 353–364.Google Scholar
  6. 6.
    KLEENE, S.C. (1956): Representation of events in nerve sets, in "Automata Studies", pp. 3–40, Princeton University Press.Google Scholar
  7. 7.
    MCWHIRTER, I.P. (1971): Substitution Expressions. J. Comp. Sys. Sci. 5, 629–637.Google Scholar
  8. 8.
    SALOMAA, A. (1966): The Complete Axiom Systems for the Algebra of Regular Events. J. ACM 13, 152–169.Google Scholar
  9. 9.
    SALOMAA, A. (1973): Formal Languages. Academic Press, New York.Google Scholar
  10. 10.
    YNTEMA, M.K. (1967): Inclusion Relations among Families of Context-Free Languages. Inform. Contr. 10, 572–597.Google Scholar
  11. 11.
    YNTEMA, M.K. (1971): Cap Expressions for Context-Free Languages. Inform. Contr. 18, 311–318.Google Scholar

Copyright information

© Springer-Verlag 1973

Authors and Affiliations

  • O. Mayer

There are no affiliations available

Personalised recommendations