Skip to main content
SpringerLink
Log in

Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof

  • Chapter
Theory Is Forever

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

  • 318 Accesses

Abstract

Regularly extended E0L grammars allow an infinite number of rules for a given nonterminal provided that the set of right sides of the rules for each nonterminal is a regular language. We show that structural equivalence remains decidable for regularly extended E0L grammars.

The research of the first author was supported under the Natural Sciences and Engineering Research Council of Canada grant OGP0147224 and that of the second was supported under the grant HKUST6166/00E from the Research Grants Council of the Hong Kong SAR.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albert, J., Giammarresi, D., Wood, D.: Normal form algorithms for extended context-free grammars. Theoret. Comput. Sci. 267, 35–47 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Berstel, J., Boasson, L.: Formal properties of XML grammars and languages. Acta Informatica 38, 649–671 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. Brüggemann-Klein, A., Wood, D.: Caterpillars: A context-specification technique. Mark-up Languages: Theory & Practice 2, 81–106 (2000)

    Article  Google Scholar 

  4. Brüggemann-Klein, A., Wood, D.: The regularity of two-way nondeterministic tree automata languages. Internat. J. of Foundations of Computer Science 13, 67–81 (2002)

    Article  MATH  Google Scholar 

  5. Cameron, H.A., Wood, D.: Structural equivalence of regularly extended contextfree grammars and SGML DTDs (manuscript) (1996)

    Google Scholar 

  6. Gécseg, F., Steinby, M.: Tree Automata, Académiai Kiadó, Budapest (1984)

    Google Scholar 

  7. Gécseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. III, pp. 1–68. Springer, Heidelberg (1997)

    Google Scholar 

  8. Istrate, G.: The strong equivalence of ET0L grammars. Inf. Process. Lett. 62, 171–176 (1997)

    Article  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  14. Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York (1980)

    MATH  Google Scholar 

  15. Salomaa, K., Wood, D., Yu, S.: Complexity of E0L structural equivalence. RAIRO Theoretical Informatics 29, 471–485 (1995)

    MATH  MathSciNet  Google Scholar 

  16. Salomaa, K., Wood, D., Yu, S.: Structural equivalence and ET0L grammars. Theoret. Comput. Sci. 164, 123–140 (1996)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  18. Salomaa, K., Yu, S.: Decidability of EDT0L structural equivalence. Theoret. Comput. Sci. 276, 245–259 (2002)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  20. Wood, D.: Theory of Computation. John Wiley & Sons, New York (1987)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, Queen’s University, Kingston, Ontario, K7L 3N6, Canada

    Kai Salomaa

  2. Department of Computer Science, Hong Kong University of Science & Technology, Clear Water Bay, Kowloon, Hong Kong

    Derick Wood

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

Editor information

Editors and Affiliations

  1. Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  2. Institute for Information Systems and Computer Media (IICM), Graz University of Technology, A-8010, Graz, Austria

    Hermann Maurer

  3. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, Bucureşti, Romania

    Gheorghe Păun

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Salomaa, K., Wood, D. (2004). Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof. In: Karhumäki, J., Maurer, H., Păun, G., Rozenberg, G. (eds) Theory Is Forever. Lecture Notes in Computer Science, vol 3113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27812-2_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27812-2_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22393-1

  • Online ISBN: 978-3-540-27812-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation