Skip to main content
SpringerLink
Log in

Vompleteness of E0L forms is decidable

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

It is proved that given an E0L form F it is decidable whether or not F is vomplete. The concept of n-completeness, n a positive integer, is introduced and it is shown that for an E0L form F and an integer n≧2 vompleteness is equivalent with n-completeness.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ainhirn, W.: How to get rid of pseudoterminals. In: Automata, languages and programming (J. de Bakker, J. van Leeuwen, eds.), Lecture Notes in Computer Science, Vol. 85, pp. 1–18. Berlin-Heidelberg-New York: Springer 1980

    Google Scholar 

  2. Ainhirn, W.: Marvellous interpretations differ little but decisively from ordinary interpretations of E0L forms. Technological University Graz, Report

  3. Ainhirn, W., Maurer, H.: On ɛ-productions for terminals in E0L forms. Discrete Applied Math. 1, 155–166 (1979)

    Google Scholar 

  4. Culick II, K., Maurer, H., Ottmann, T.: On two-symbol complete E0L forms. Theoretical Computer Science 6, 69–92 (1978)

    Google Scholar 

  5. Ehrenfeucht, A., Rozenberg, G., Verraedt, R.: Basic formulas and languages, Part I. The theory. Discrete Applied Math. 3, 235–255 (1981)

    Google Scholar 

  6. Ehrenfeucht, A., Rozenberg, G., Verraedt, R.: Basic formulas and languages, Part II. Applications to E0L systems and forms. Discrete Applied Math. 4, 11–22 (1982)

    Google Scholar 

  7. Maurer, H., Ottmann, T., Salomaa, A.: On the form equivalence of L forms. Theor. Comput. Sci. 4, 199–225 (1977)

    Google Scholar 

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

    Google Scholar 

  9. Maurer, H., Salomaa, A., Wood, D.: Uniform interpretations of L forms. Information and Control 36, 157–173 (1978)

    Google Scholar 

  10. Maurer, H., Salomaa, A., Wood, D.: On good E0L forms. SIAM J. Comput. 7, 158–166 (1978)

    Google Scholar 

  11. Maurer, H., Salomaa, A., Wood, D.: Relative goodness of E0L forms. RAIRO Inform, th. 4, 219–230 (1978)

    Google Scholar 

  12. Rozenberg, G., Verraedt, R.: On pure, terminal invariant and nonterminal invariant interpretations of E0L forms. Theor. Comput. Sci. 14, 267–288 (1981)

    Google Scholar 

  13. Rozenberg, G., Verraedt, R.: On fixed, terminal fixed and nonterminal fixed interpretations of E0L forms. Information and Control 48, 119–146 (1981)

    Google Scholar 

  14. Rozenberg, G., Salomaa, A.: The mathematical theory of L systems. New York: Academic Press 1980

    Google Scholar 

  15. Wood, D.: Grammar and L forms: An Introduction. New York: Springer 1980

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics and Computer Science, University of Leiden, 2300, RA Leiden, The Netherlands

    G. Rozenberg

  2. Department of Mathematics, University of Antwerp, U.I.A., B-2610, Wilrijk, Belgium

    R. Verraedt

Authors
  1. G. Rozenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Verraedt
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research assistant of the Belgium Fund for Scientific Research (NFWO)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rozenberg, G., Verraedt, R. Vompleteness of E0L forms is decidable. Acta Informatica 17, 69–87 (1982). https://doi.org/10.1007/BF00262977

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation