Skip to main content
Log in

On generators and generative capacity of EOL forms

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

In this paper we study the generative capacity of EOL forms from two different points of view. On the one hand, we consider the generative capacity of special EOL forms which one could call ‘linear like’ and ‘context free like’, establishing the existence of a rich variety of non-regular sub-EOL language families. On the other hand, we propose the notion of a ‘generator’ L of a language family We mean by this that any synchronized EOL system generating L generates — if understood as an EOL form — all languages of . We characterize the generators of the family of regular languages, and prove that other well known language families do not have generators.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Amar, V., Putzolu, G.: On a family of linear grammars. Information and Control 7, 283–291 (1964)

    Google Scholar 

  2. Cremers, A.B., Ginsburg, S.: Context free grammar forms, J. Comput. System Sci. 11, 86–117 (1975)

    Google Scholar 

  3. Culik, K. II, Maurer, H.A., Ottmann, Th.: On two-symbol Complete EOL forms. Theor. Comput. Sci. 6, 69–92 (1978)

    Google Scholar 

  4. Ginsburg, S.: Algebraic and automata-theoretic properties of formal languages. Amsterdam: North-Holland 1975

    Google Scholar 

  5. Ginsburg, S.: The mathematical theory of context-free languages, New York: McGraw Hill 1966

    Google Scholar 

  6. Ginsburg, S.: A survey of form theory. Presented at: Mathematical Foundations of Computer Science, Tatranská Lomnica 1977

  7. Maurer, H.A.: Theoretische Grundlagen der Programmiersprachen, Mannheim: Bibliographisches Institut 1969

    Google Scholar 

  8. Maurer, H.A., Salomaa, A., Wood, D.: EOL forms. Acta Informatica 8, 75–96 (1977)

    Google Scholar 

  9. Maurer, H.A., Rozenberg, G., Salomaa, A., Wood, D.: Pure interpretations of EOL forms. McMaster University Report (1977)

  10. Salomaa, A.: Formal languages: New York-London: Academic Press 1973

    Google Scholar 

  11. Salomaa, A., Soittola, M.: Automata-theoretic aspects of formal power series. Berlin-Heidelberg-New York: Springer 1978

    Google Scholar 

  12. Siebel, D.: Abschlußeigenschaften synchronisierter EOL-Formen und strikt interpretierter Grammatik-Formen. Studienarbeit Univ. Karlsruhe (1977)

Download references

Author information

Authors and Affiliations

Authors

Additional information

Partially supported under NSE Research Council of Canada, grant No. A-7700

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maurer, H.A., Salomaa, A. & Wood, D. On generators and generative capacity of EOL forms. Acta Informatica 13, 87–107 (1980). https://doi.org/10.1007/BF00288538

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00288538

Keywords

Navigation