Skip to main content
SpringerLink
Log in

The equivalences problems for binary EOL-Systems are decidable

  • Section C Computability, Decidability & Arithmetic Complexity
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1977)

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

Included in the following conference series:

  • 309 Accesses

Abstract

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.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • 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 

  • 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 

  • 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 

  • Doner, J.E. (1965), Decidability of the weak second-order theory of two successors, Notices Amer. Math. Soc. 12, 819.

    Google Scholar 

  • Herman, G.T. and Rozenberg, G. (1975), Developmental systems and Languages, North-Holland, Amsterdam.

    Google Scholar 

  • 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 

  • Karpiński, M. (1975), Almost deterministic ω-automata with existential output condition, Proc. Amer. Math. Soc. 53, 449–452.

    Google Scholar 

  • Lindenmayer, A. (1968), Mathematical models for cellular interaction in development, Part I, and II, J. Theoret. Biol. 18, 280–315.

    Google Scholar 

  • Magidor, M. and Moran, G. (1970), Probablistic tree automata and context-free languages, Israel J. Math. 8, 340–348.

    Google Scholar 

  • Magidor, M. and Moran, G. (1969), Finite automata over finite trees, Tech. Rept. 30, Hebrew University, Jerusalem, Israel.

    Google Scholar 

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

    Google Scholar 

  • Nielsen, M. (1974), On the decidability of some equivalence problems for DOL-systems, Information and Control 25, 166–193.

    Google Scholar 

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

    Google Scholar 

  • 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 

  • 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 

  • Rabin, M.O. (1969), Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141, 1–35.

    Google Scholar 

  • 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 

  • Rozenberg, G. (1972 b), The equivalence problem for deterministic TOL-systems is undecidable, Inform. Process. Lett. 1, 201.

    Google Scholar 

  • Rozenberg, G. and Salomaa, A. eds. (1974), L Systems, Lecture Notes in Computer Science, Vol. 15, Springer-Verlag, Berlin.

    Google Scholar 

  • Salomaa, A. (1972 a), On sentential forms of context-free grammars, Acta Informatika 2, 40.

    Google Scholar 

  • Salomaa, A. (1973 b), Formal Languages, Academic Press, New York.

    Google Scholar 

  • 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 

  • 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 

  • Thatcher, J.W. (1970), Generalized2 sequential machines, J. Comput. System Sci. 4, 339–367.

    Google Scholar 

  • Vitányi, P. (1973), Structure of growth in Lindenmayer systems, Indagationes Mathematicae 35, 247–253.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Mathematical Institute of the, Polish Academy of Sciences, 61725, Poznaán, Poland

    Marek Karpiński

Authors
  1. Marek Karpiński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpiński

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karpiński, M. (1977). The equivalences problems for binary EOL-Systems are decidable. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_111

Download citation

  • DOI: https://doi.org/10.1007/3-540-08442-8_111

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-37084-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation