The equivalences problems for binary EOL-Systems are decidable

  • Marek Karpiński
Section C Computability, Decidability & Arithmetic Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 56)


The recursive solvability of the Equivalence Problem for Binary EOL-Systems has been proved. As an application of a general method we prove also the decidability of the Structural Equivalence Problem for arbitrary EOL-Systems.


Generation Tree Equivalence Problem Finite Automaton Closure Property Balance Tree 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Blattner, M. (1972; 1973), The unsolvability of the equality problem for sentential forms of context-free grammars, Notices Amer. Math. Soc., Abstract 72T-C15, p. A-325, and J. Comput. System Sci. 7, 463–468.Google Scholar
  2. Büchi, J.R. (1960), On a decision method in restricted second order arithmetic, Proc. Internat. Congr. Logic, Method. and Philos. Sci., Stanford Univ. Press, Stanford, California, 1962, pp. 1–11.Google Scholar
  3. Büchi, J.R. and Elgot, C.C. (1958), Decision problems of weak second-order arithmetics and finite automata. Part I, Abstract 553-112, Notices Amer. Math. Soc. 5, 834.Google Scholar
  4. Doner, J.E. (1965), Decidability of the weak second-order theory of two successors, Notices Amer. Math. Soc. 12, 819.Google Scholar
  5. Herman, G.T. and Rozenberg, G. (1975), Developmental systems and Languages, North-Holland, Amsterdam.Google Scholar
  6. Karpiński, M. (1973, 1974), Free structure tree automata I–IV, Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys. 21, 441–446, 447–450, 567–572, 22, 87–91.Google Scholar
  7. Karpiński, M. (1975), Almost deterministic ω-automata with existential output condition, Proc. Amer. Math. Soc. 53, 449–452.Google Scholar
  8. Lindenmayer, A. (1968), Mathematical models for cellular interaction in development, Part I, and II, J. Theoret. Biol. 18, 280–315.Google Scholar
  9. Magidor, M. and Moran, G. (1970), Probablistic tree automata and context-free languages, Israel J. Math. 8, 340–348.Google Scholar
  10. Magidor, M. and Moran, G. (1969), Finite automata over finite trees, Tech. Rept. 30, Hebrew University, Jerusalem, Israel.Google Scholar
  11. McNaughton, R. (1967), Parenthesis grammars, J. Assoc. Comp. Mach. 14, 490–500.Google Scholar
  12. Nielsen, M. (1974), On the decidability of some equivalence problems for DOL-systems, Information and Control 25, 166–193.Google Scholar
  13. Paul, M.C., and Unger, S.H. (1968), Structural equivalence of context-free grammars, J. Comput. System Sci. 2, 427–463.Google Scholar
  14. Rabin, M.O. and Scott, D. (1959), Finite automata and their decision problems, IBM J. Res. Develop. 3, 114–125, reprinted in Sequential machines, selected papers, edited by E.F. Moore, Addison-Wesley, Reading, Mass., 1964.Google Scholar
  15. Rabin, M.O. (1968), Mathematical theory of automata, proc. Sympos. Appl. Math. Vol. 19, Amer. Math. Soc., Providence, R.I., 1968, pp. 153–175.Google Scholar
  16. Rabin, M.O. (1969), Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141, 1–35.Google Scholar
  17. Rozenberg, G. (1972 a), Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for OL-systems, Information Process. Lett. 1, 233.Google Scholar
  18. Rozenberg, G. (1972 b), The equivalence problem for deterministic TOL-systems is undecidable, Inform. Process. Lett. 1, 201.Google Scholar
  19. Rozenberg, G. and Salomaa, A. eds. (1974), L Systems, Lecture Notes in Computer Science, Vol. 15, Springer-Verlag, Berlin.Google Scholar
  20. Salomaa, A. (1972 a), On sentential forms of context-free grammars, Acta Informatika 2, 40.Google Scholar
  21. Salomaa, A. (1973 b), Formal Languages, Academic Press, New York.Google Scholar
  22. Thatcher, J.W. (1967), Characterizing derivation trees of context-free grammars through a generalization of finite automata theory, J. Comput. System Sci. 1, 317–322.Google Scholar
  23. Thatcher, J.W. and Wright, J.B. (1968), Generalized finite automata theory with an application to a decision problem of second-order logic, Mathematical Systems Theory 2, 57–81.Google Scholar
  24. Thatcher, J.W. (1970), Generalized2 sequential machines, J. Comput. System Sci. 4, 339–367.Google Scholar
  25. Vitányi, P. (1973), Structure of growth in Lindenmayer systems, Indagationes Mathematicae 35, 247–253.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Marek Karpiński
    • 1
  1. 1.The Mathematical Institute of thePolish Academy of SciencesPoznaánPoland

Personalised recommendations