Automatic presentations of structures

  • Bakhadyr Khoussainov
  • Anil Nerode
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 960)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Aspects of Effective Algebra, Proceedings of a Conference at Monash University, 1979, edited by J.N. Crossley.Google Scholar
  2. [2]
    C.J. Ash, A. Nerode, Intrinsically Recursive Relations, Aspects of Effective Algebra, Proceeding of a Conference at Monash University, Australia, 1979.Google Scholar
  3. [3]
    R. Buchi, The Monadic Theory of ω1, in: Decidable Theories II, Lecture Notes in Mathematics, 328, 1–127.Google Scholar
  4. [4]
    R. Buchi, D. Siefkes, Axiomatization of the Monadic second Order Theory of ω1, in: Decidable Theories II, Lect. Not. in Mathematics, 328, 127–215.Google Scholar
  5. [5]
    S. Eilenberg, Automata, Languages, and Mashines, vol. A, Academic Press, New York, 1974.Google Scholar
  6. [6]
    D.Epstein, J.Cannon, and others, Word Processing in Groups, Jones and Bartlett Publishers, Boston, London.Google Scholar
  7. [7]
    Yu.L. Ershov, Problems of Decidability and Constructive Models, Moscow, 1989.Google Scholar
  8. [8]
    A.Frohlich, J. Shepherdson, Effective Procedures in Field Theory, Philos. Tranns. Roy. Soc, London, ser A 248, 1955, 432–487.Google Scholar
  9. [9]
    S.S. Goncharov, The Problem of the Number Of Non-Self-Equivalent Constructivizations, Algebra and Logic, No 6, 1980.Google Scholar
  10. [10]
    Y. Gurevich and L. Harrington, Trees, Automata and Games, Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982, 60–65.Google Scholar
  11. [11]
    A.I. Mal'cev A.I, Constructive Algebras, Uspekhi Matem. Nauk, 16, No 3, 1961.Google Scholar
  12. [12]
    M. Rabin, Decidability of Second-Order Theories and Automata on Infinite Trees, Trans. of American Math. Soc., 141, 1969, 1–35.Google Scholar
  13. [13]
    M.Rabin, Weakly Definable Relations and Special Automata, Mathematical Logic and Foundations of Set Theory, North-Holland, Amsterdam, 1970, 1–23.Google Scholar
  14. [14]
    M. Rabin, Computable Algebra: General theory and Theory of Computable Fields, Trans. Amer. Math. Soc., 95, 1960, 341–360Google Scholar
  15. [15]
    J.B. Remmel, D. Cenzer, Polynomial Time Versus Recursive Models, Annals of Pure and Applied Logic, 1991.Google Scholar
  16. [16]
    J.B. Remmel, D. Cenzer, Feasibly Categorical Abelian Groups, Proceedings of the Workshop Feasible Mathematics II, to appear.Google Scholar
  17. [17]
    H. Rogers, Theory of Recursive Function and Effective Computability, New York, 1967.Google Scholar
  18. [18]
    W. Thomas, Automata on Infinite Objects, in Handbook of Theoretical Computer Science, Volume B, J. van Leeuwen editor, The MIT Press/Elsevier, 1990, 133–192.Google Scholar
  19. [19]
    C. Frougny, J. Sakarovitch, Synchronized Ratinal Relations of Finite and Infinite Words, Theoretical Computer Science, 108, 1993, 45–82.Google Scholar
  20. [20]
    B.Khoussainov, A. Nerode, Automatic Models and S2S, in preparation.Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Bakhadyr Khoussainov
  • Anil Nerode

There are no affiliations available

Personalised recommendations