Advertisement

The sequence equivalence problem for dol systems is decidable

  • K. ČulikII
  • I. Friš
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)

Abstract

The sequence equivalence problem for DOL systems is shown to be decidable. In an algebraic formulation the sequence equivalence problem for DOL systems can be stated as follows: Given homomorphisms h1 and h2 on a free monoid Σ* and a word σ from Σ*, is h 1 n (σ)=h 2 n (σ) for all n>0?

Keywords

Normal System Equivalence Problem Equivalent System Proof Outline Growth Matrix 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Culik II, K., On the decidability of the sequence equivalence problem for DOL-systems, Theoretical Computer Science 3, 75–84 (1977).Google Scholar
  2. 2.
    Culik II, K. and Fris, I., The decidability of the equivalence problem for DOL-systems, Inf. and Control, in print, also Res. Rep. CS-76-25, Dept. of Computer Science, University of Waterloo (1976).Google Scholar
  3. 3.
    Culik II, K., On some families of languages related to developmental systems, Inter. J. of Computer Math. 4, Section A, 31–42 (1974).Google Scholar
  4. 4.
    Gantmacher, F. R., The Theory of Matrices, vol. 2, Chelsea, New York (1960).Google Scholar
  5. 5.
    Lindenmayer, A., Developmental systems without cellular interaction, their languages and grammar, J. of Theoretical Biology 30, 455–484 (1971).Google Scholar
  6. 6.
    Nielsen, M., On the decidability of some equivalence problem for DOL-systems, Information and Control 25, 166–193 (1974).Google Scholar
  7. 7.
    Paz, A. and Salomaa, A., Integral sequential word functions and growth equivalence of Lindenmayer systems, Information and Control 23, 313–343 (1973).Google Scholar
  8. 8.
    Problem Book, Unusual Automata Theory, January 1972, Dept. of Computer Science, University of Aarhus Techn. rep. DAIMI PB-15, 14–26 (1973).Google Scholar
  9. 9.
    Rozenberg, G., Extensions of tabled OL-systems and languages, Inter. J. of Computer and Information Sciences, Vol. 2, 311–334 (1973).Google Scholar
  10. 10.
    Salomaa, A., Formal Languages, Academic Press, New York, (1973).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • K. ČulikII
    • 1
  • I. Friš
    • 2
  1. 1.University of WaterlooWaterlooCanada
  2. 2.University of New EnglandArmidaleAustralia

Personalised recommendations