Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 1993: Fundamentals of Computation Theory pp 430–439Cite as

Structural Equivalence and ETOL grammars

Extended abstract

  • Communications
  • Conference paper
  • First Online:

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

Abstract

For a given context-sensitive grammar G we construct ET0L grammars G 1 and G 2 that are structurally equivalent if and only if the language generated by G is empty, which implies that structural equivalence is undecidable for ET0L grammars. This is in contrast to the decidability result for the E0L case. In fact, we show that structural equivalence is undecidable for propagating ET0L grammars even when the number of tables is restricted to be at most two. A stronger notion of equivalence that requires the sets of syntax trees to be isomorphic is shown to be decidable for ET0L grammars.

Research supported by the Natural Sciences and Engineering Research Council of Canada grants.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Ginsburg and M. Harrison, Bracketed context-free languages, J. Comput. System Sci. 1 (1967) 1–23.

    Google Scholar 

  2. R. McNaughton, Parenthesis grammars, J. Assoc. Comput. Mach. 14 (1967) 490–500.

    Google Scholar 

  3. V. Niemi, A normal form for structurally equivalent E0L grammars. In: “Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology”, G. Rozenberg and A. Salomaa (eds.), Springer-Verlag, 1992, pp. 133–148.

    Google Scholar 

  4. T. Ottmann and D. Wood, Defining families of trees with E0L grammars, Discrete Applied Math. 32 (1991) 195–209.

    Article  Google Scholar 

  5. T. Ottmann and D. Wood, Simplifications of E0L grammars. In: “Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology”, G. Rozenberg and A. Salomaa (eds.), Springer-Verlag, 1992, pp. 149–166.

    Google Scholar 

  6. M. Paull and S. Unger, Structural equivalence of context-free grammars, J. Comput. System Sci. 2 (1968) 427–463.

    Google Scholar 

  7. M. Penttonen, One-sided and two-sided context in formal grammars, Inform. Control 25 (1974) 371–392.

    Article  Google Scholar 

  8. G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems. Academic Press, New York, 1980.

    Google Scholar 

  9. A. Salomaa, Formal Languages. Academic Press, New York, 1973.

    Google Scholar 

  10. K. Salomaa and S. Yu, Decidability of structural equivalence of E0L grammars, Theoret. Comput. Sci. 82 (1991) 131–139.

    Article  Google Scholar 

  11. J. W. Thatcher, Tree automata: an informal survey. In: “Currents in the Theory of Computing”, A. V. Aho (ed.), Prentice Hall, Englewood Cliffs, NJ, 1973, pp. 143–172.

    Google Scholar 

  12. D. Wood, Theory of Computation. John Wiley & Sons, New York, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Western Ontario, N6A 5B7, London, Ontario, Canada

    Kai Salomaa, Derick Wood & Sheng Yu

Authors
  1. Kai Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Derick Wood
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sheng Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Ésik

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Salomaa, K., Wood, D., Yu, S. (1993). Structural Equivalence and ETOL grammars. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-57163-9_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57163-6

  • Online ISBN: 978-3-540-47923-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation