Automatic presentations of structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 960, Issue , 1995, Pages 367-392

  Khoussainov, Bakhadyr ^a   Nerode, Anil ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957650553     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60178-3_93     Document Type: Conference Paper

References (20)

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