Skip to main content
SpringerLink
Log in

Equivalence Problems for Regular sets of Word Morphisms

  • Chapter
The Book of L

Abstract

Despite its firm basis in theoretical biology L systems theory has had some far reaching repercussions in mathematics and theoretical computer science. One of these is the emphasis on iterated composition of morphisms on a free monoid (word morphisms). This leads naturally to set equivalence problems, familiar from formal language theory, and sequence equivalence problems (variously known also as strong equivalence, graph equivalence or tree equivalence problems in deterministic L systems theory).

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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, M.H. & Lawrence, J.: A proof of Ehrenfeucht’s conjecture. Theoret. Comput. Sci., to appear

    Google Scholar 

  2. Berstel, J. & Nielsen, M.: The growth range equivalence problem for DOL systems is decidable. In Automata, Languages, Development (A. Lindenmayer & G. Rozenberg, eds.). North-Holland. Amsterdam (1976), 161–178

    Google Scholar 

  3. Culik, K. II & Karhumäki, J.: Systems of equations over a free monoid and Ehrenfeucht conjecture. Discrete Math. 43 (1983), 139–154

    Article  MathSciNet  MATH  Google Scholar 

  4. Ehrenfeucht, A. & Rozenberg, G.: On a bound for the DOL sequence equivalence problem. Theoret. Comput. Sci. 12 (1980), 339–342

    Article  MathSciNet  MATH  Google Scholar 

  5. Gronau, H.-D.O.F. & Steffen, G.: A problem of L system interest. Math. Nachr. 99 (1980). 29–31

    Article  MathSciNet  MATH  Google Scholar 

  6. Hall, P.: Finiteness conditions for soluble groups. Proc. London Math. Soc. (3) 4 (1954), 419–436

    Article  MathSciNet  MATH  Google Scholar 

  7. Jones, J.P.: Universal diophantine equation. J. Symbolic Logic 47 (1982). 549–571

    Article  MathSciNet  MATH  Google Scholar 

  8. Karhumäki, J.: On the equivalence problem for binary DOL systems. Inform, and Control 50 (1981). 276–284

    Article  MathSciNet  MATH  Google Scholar 

  9. KomlÓs, J.: On the determinant of random matrices. Stud. Sci. Math. Hungar. 3 (1968), 387–399

    MATH  Google Scholar 

  10. Makanin, G.S.: The problem of solvability of equations in a free semigroup. Math. USSR Sbornik 32 (1977). 129–198

    Article  MATH  Google Scholar 

  11. Nielsen, M.: Equivalence of L-systems. In L Systems (G. Rozenberg & A. Salo-maa. eds.). Lecture Notes in Computer Science 15. Springer-Verlag, Berlin (1974), 142–145

    Google Scholar 

  12. Rozenberg, G.: The equivalence problem for deterministic T0L-systems is undecidable. Inform. Process. Lett. 1 (1972), 201–204. Errata p. 252

    Article  MATH  Google Scholar 

  13. Rozenberg, G. & Salomaa, A.: The mathematical theory of L systems. In Advances in Information Systems Science 6 (J.T. Tou, ed.). Plenum Press, New York (1976), 161–206

    Chapter  Google Scholar 

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

    MATH  Google Scholar 

  15. Ruohonen, K.: Test sets for iterated morphisms. Manuscript (1984)

    Google Scholar 

  16. Ruohonen, K.: The decidability of the D0L-DT0L equivalence problem. J. Comput. System Sci. 22 (1981). 42–52

    Article  MathSciNet  MATH  Google Scholar 

  17. Ruohonen, K.: On equality of multiplicity sets of regular languages. Theoret. Comput. Sci. 36 (1985), 113–117

    Article  MathSciNet  MATH  Google Scholar 

  18. Ruohonen, K.: The inclusion problem for DOL languages. Elektron. Informationsverarb. Kybernetik 15 (1979), 535–548

    MathSciNet  MATH  Google Scholar 

  19. Ruohonen, K.: On a variant of a method of Berstel’s and Nielsen’s. Fund. Inform. IV.2 (1981), 369–400

    MathSciNet  Google Scholar 

  20. Ruohonen, K.: The decidability of the FOL-DOL equivalence problem. Inform. Process. Lett. 8 (1979), 257–160

    Article  MathSciNet  MATH  Google Scholar 

  21. Salomaa, A.: DOL equivalence: The problem of iterated morphisms. Bull. Eatcs 4 (1978). 5–12

    MathSciNet  Google Scholar 

  22. Salomaa, A.: Jewels of Formal Language Theory. Computer Science Press, Rock-ville MD (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Tampere University of Technology, SF-33101, Tampere 10, Finland

    Keijo Ruohonen

Authors
  1. Keijo Ruohonen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ruohonen, K. (1986). Equivalence Problems for Regular sets of Word Morphisms. In: The Book of L. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95486-3_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-95486-3_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-95488-7

  • Online ISBN: 978-3-642-95486-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation