Access the full text.
Sign up today, get DeepDyve free for 14 days.
Achim Blumensath, E. Grädel (2000)
Automatic structuresProceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)
Antonio Montalb´an (2006)
LINEAR ORDERINGS
Markus Lohrey (2003)
Automatic Structures of Bounded Degree
B. Khoussainov, S. Rubin, F. Stephan (2004)
Definability and Regularity in Automatic Structures
D. Kuske (2003)
Is Cantor's Theorem Automatic?
F. Hausdorff (1908)
Grundzüge einer Theorie der geordneten MengenMathematische Annalen, 65
B. Khoussainov, A. Nerode (1994)
Automatic Presentations of Structures
R. Goodstein, H. Rogers (1969)
Theory of Recursive Functions and Effective ComputabilityThe Mathematical Gazette, 53
D. Epstein (1992)
Word processing in groups
B. Khoussainov, S. Rubin (2001)
Graphs with Automatic Presentations over a Unary AlphabetJ. Autom. Lang. Comb., 6
(2003)
Received November ACM Transactions on Computational Logic
B. Khoussainov, S. Rubin (2003)
Automatic Structures: Overview and Future DirectionsJ. Autom. Lang. Comb., 8
B. Khoussainov, A. Nerode (2001)
Automata theory and its applications
S. Eilenberg, C. Elgot, J. Shepherdson (1969)
Sets recognized by n-tape automataJournal of Algebra, 13
Jr. Rogers (1969)
Theory of Recursive Functions and Effective Computability
L. Moss, Hans-Jörg Tiede (2004)
Review of "Automata theory and its applications" by Bakhadyr Khoussainov and Anil Nerode. Birkhäuser Boston, Inc. 2001.: and "Automata, logics, and infinite games" by E.Grädel, W. Thomas, and T. Wilke. Springer-Verlag.SIGACT News, 35
B. Khoussainov, A. Nies, S. Rubin, F. Stephan (2004)
Automatic structures: richness and limitationsProceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
H. Ishihara, B. Khoussainov, S. Rubin (2002)
Some results on automatic structuresProceedings 17th Annual IEEE Symposium on Logic in Computer Science
C. Delhommé (2004)
Automaticité des ordinaux et des graphes homogènesComptes Rendus Mathematique, 339
A. Kechris (1987)
Classical descriptive set theory
We investigate partial orders that are computable, in a precise sense, by finite automata. Our emphasis is on trees and linear orders. We study the relationship between automatic linear orders and trees in terms of rank functions that are related to Cantor--Bendixson rank. We prove that automatic linear orders and automatic trees have finite rank. As an application we provide a procedure for deciding the isomorphism problem for automatic ordinals. We also investigate the complexity and definability of infinite paths in automatic trees. In particular, we show that every infinite path in an automatic tree with countably many infinite paths is a regular language.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Oct 1, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.