Automaticity of ordinals and of homogeneous graphs
From MaRDI portal
Publication:1876889
DOI10.1016/j.crma.2004.03.035zbMath1077.68071MaRDI QIDQ1876889
Publication date: 20 August 2004
Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.crma.2004.03.035
05C80: Random graphs (graph-theoretic aspects)
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
03D05: Automata and formal grammars in connection with logical questions
Related Items
AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES, Pumping for ordinal-automatic structures1, Tree-Automatic Well-Founded Trees, Tree-automatic scattered linear orders, Automatic models of first order theories, Subalgebras of FA-presentable algebras., Model-theoretic complexity of automatic structures, The isomorphism relation between tree-automatic structures, Height of a superposition, Automatic presentations for semigroups., Semiautomatic structures, A note on ordinal DFAs, An undecidable property of context-free linear orders, Complexity and categoricity of injection structures induced by finite state transducers, Effective categoricity of automatic equivalence and nested equivalence structures, Model-theoretic properties of \(\omega\)-automatic structures, The isomorphism problem for tree-automatic ordinals with addition, On decidability of list structures, Isomorphisms of scattered automatic linear orders, The isomorphism problem on classes of automatic structures with transitive relations, Injection Structures Specified by Finite State Transducers, ALGEBRAIC LINEAR ORDERINGS, Automata on Ordinals and Linear Orders, Where Automatic Structures Benefit from Weighted Automata, UNARY FA-PRESENTABLE SEMIGROUPS, Model Theoretic Complexity of Automatic Structures (Extended Abstract), Automata Presenting Structures: A Survey of the Finite String Case, Automatic Presentations for Cancellative Semigroups
Cites Work
