Church-rosser transformers and decidable propertis of tree processing

  • A. V. Anisimov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 122)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Anisimov A.V. On Group Languages, "Cybernetics", n.4, Kiev, 1971 (in Russian).Google Scholar
  2. 2.
    Anisimov A.V. Backtracking Descrete Transformers, "Cybernetics", n.6, Kiev, 1979 (in Russian).Google Scholar
  3. 3.
    Glushkov V.M., Anisimov A.V. Church — Rosser Transformers, "Cybernetics", n.5, Kiev, 1979 (in Russian)Google Scholar
  4. 4.
    Letichevsky A.A. Equivalence of automata over semigroups, Proceedence "Theoretical Cybernetics", v.6, Institute of Cybernetics, Kiev, 1970 (in Russian)Google Scholar
  5. 5.
    Letichevsky A.A., Smikun L.B. On Classes of Groups with Solvable Equivalence Problem for Automata, Soviet Math. Dokl., n.1, Moscow, 1976Google Scholar
  6. 6.
    Letichevsky A.A. Equivalence of Automata with Final States Over Free Semigroups with Right Nulls, Soviet Math. Dokl., n.5, Moscow, 1968Google Scholar
  7. 7.
    Aho A.V., Sethi R, Ullman J.D. Code Optimization and Finite Church — Rosser Systems, in the book "Design and Optimization of Compilers", Prentice Hall, USA, 1972Google Scholar
  8. 8.
    Donner J.E. Decidability of the Weak Second-Order Theory of Two Successors, Abstract 65T-468 "Notes of the American Mathematical Society", v.12, 1965Google Scholar
  9. 9.
    Thatcher J.W., Wright J.B. Generalised Finite Automata Theory with an Application to a Decision of Second Order Logic, Mathematical Systems Theory, v.2, n.1, 1968Google Scholar
  10. 10.
    Tokura N., Kasami T., Furuta S. Ianov Schemes Augmented by a Pushdown Memory, IEEE 15th Annual Symposium on Switching and Automata Theory, New Orleans, USA, 1974Google Scholar
  11. 11.
    Paul M.C., Unger S.H. Structural Equivalence of Context-Free Grammars, "Journal of Computer and System Sciences", v.2, n.4, 1968Google Scholar
  12. 12.
    Rabin M.O. Decidability of Second-Order Theories and Automata on Infinite Trees, Transactions of American Mathematical Society, v.141, n.7, 1969Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • A. V. Anisimov
    • 1
  1. 1.Department of CyberneticsKiev State UniversityKiev-17USSR

Personalised recommendations