Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Graphs with automatic presentations over a unary alphabet
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Automata Theory and Its Applications
Automata Theory and Its Applications
Word Processing in Groups
Some Results on Automatic Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Automatic structures: overview and future directions
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Automatic Structures: Richness and Limitations
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Unary automatic graphs: An algorithmic perspective
Mathematical Structures in Computer Science
Theories of Automatic Structures and Their Complexity
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Model theoretic complexity of automatic structures
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Unary automatic graphs: an algorithmic perspective
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Linear orders in the pushdown hierarchy
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
The isomorphism problem for ω-automatic trees
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Automatic structures and groups
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Size and computation of injective tree automatic presentations
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Automata on ordinals and linear orders
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Decidability of term algebras extending partial algebras
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Where automatic structures benefit from weighted automata
Algebraic Foundations in Computer Science
Hausdorff rank of scattered context-free linear orders
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
On context-free languages of scattered words
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Word automaticity of tree automatic scattered linear orderings is decidable
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Tree-Automatic well-founded trees
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
A context-free linear ordering with an undecidable first-order theory
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
The FC-rank of a context-free language
Information Processing Letters
| Hi-index | 0.00 |
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.