Skip to main content
SpringerLink
Log in

How to get rid of pseudoterminals

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1980)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 85))

Included in the following conference series:

Abstract

We investigate the role of pseudoterminals for EOL forms. This leads us to the definition of m — interpretation which avoids pseudoterminals. We solve the problem of m — completeness of short and simple EPOL forms and finally consider the validity of some basic results on EOL forms under m — interpretation.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Ainhirn, How to get rid of pseudoterminals, Report No. 34, Institut für Informationsverarbeitung TU Graz (1979).

    Google Scholar 

  2. W. Ainhirn, H. A. Maurer, On ɛ productions for terminals in EOL forms, Discrete Applied Mathematics 1 (1979), 155–166.

    Google Scholar 

  3. K. Culik II, H. A. Maurer, Propagating chain — free normal forms for EOL systems, Information and Control 36 (1978), 309–319.

    Google Scholar 

  4. K. Culik II, H. A. Maurer, Th. Ottmann, Two — symbol complete EOL forms, Theoretical Computer Science 6 (1978), 69–92.

    Google Scholar 

  5. A. Ehrenfeucht, G. Rozenberg, The equality of EOL languages and codings of OL languages, International Journal of Computer Mathematics 4, Section A (1974), 95–104.

    Google Scholar 

  6. M. A. Harrison, Introduction to formal language theory, Addison-Wesley, Reading (1978).

    Google Scholar 

  7. G. T. Herman, Closure properties of some families of languages associated with biological systems, Information and Control 24 (1974), 101–121.

    Google Scholar 

  8. G. T. Herman, G. Rozenberg, Developmental systems and languages, North Holland Publishing Company, Amsterdam (1975).

    Google Scholar 

  9. A. Lindenmayer, Mathematical modells for cellular interactions in development, Journal of Theoretical Biology 18 (1968), 280–315.

    Google Scholar 

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

    Google Scholar 

  11. H. A. Maurer, A. Salomaa, D. Wood, On generators and generative capacity of EOL forms, Acta Informatica 13 (1980), 87–107.

    Google Scholar 

  12. H. A. Maurer, A. Salomaa, D. Wood, Pure grammars, Mc Master University TR No. 79 — CS — 7 (1979).

    Google Scholar 

  13. G. Rozenberg, A. Salomaa, The mathematical theory of L systems, Academic Press, New York, to appear.

    Google Scholar 

  14. D. Wood, Grammar and L forms, Springer Verlag, New York, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informationsverarbeitung, Technische Universität Graz, Steyrergasse 17, A-8010, Graz, Austria

    W. Ainhirn

Authors
  1. W. Ainhirn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jaco de Bakker Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ainhirn, W. (1980). How to get rid of pseudoterminals. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-10003-2_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10003-4

  • Online ISBN: 978-3-540-39346-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation