Automaticity of ordinals and of homogeneous graphs

From MaRDI portal
Revision as of 12:57, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1876889

DOI10.1016/j.crma.2004.03.035zbMath1077.68071OpenAlexW2025670714MaRDI QIDQ1876889

Christian Delhommé

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




Related Items (28)

Tree-automatic scattered linear ordersPumping for ordinal-automatic structures1UNARY FA-PRESENTABLE SEMIGROUPSHeight of a superpositionAutomatic models of first order theoriesModel Theoretic Complexity of Automatic Structures (Extended Abstract)Automata Presenting Structures: A Survey of the Finite String CaseSemiautomatic structuresEffective categoricity of automatic equivalence and nested equivalence structuresA note on ordinal DFAsAn undecidable property of context-free linear ordersModel-theoretic complexity of automatic structuresInjection Structures Specified by Finite State TransducersIsomorphisms of scattered automatic linear ordersSubalgebras of FA-presentable algebras.Automatic Presentations for Cancellative SemigroupsModel-theoretic properties of \(\omega\)-automatic structuresThe isomorphism relation between tree-automatic structuresThe isomorphism problem for tree-automatic ordinals with additionTree-Automatic Well-Founded TreesAUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURESALGEBRAIC LINEAR ORDERINGSAutomata on Ordinals and Linear OrdersWhere Automatic Structures Benefit from Weighted AutomataAutomatic presentations for semigroups.The isomorphism problem on classes of automatic structures with transitive relationsOn decidability of list structuresComplexity and categoricity of injection structures induced by finite state transducers



Cites Work


This page was built for publication: Automaticity of ordinals and of homogeneous graphs