Automatic linear orders and trees
From MaRDI portal
Publication:5277736
DOI10.1145/1094622.1094625zbMath1367.03070MaRDI QIDQ5277736
Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan
Publication date: 12 July 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1094622.1094625
03D05: Automata and formal grammars in connection with logical questions
06A05: Total orders
03C57: Computable structure theory, computable model theory
Related Items
Pumping for ordinal-automatic structures1, Tree-Automatic Well-Founded Trees, Tree-automatic scattered linear orders, Subalgebras of FA-presentable algebras., Model-theoretic complexity of automatic structures, FA-presentable groups and rings, From automatic structures to automatic groups., The isomorphism problem for FST injection structures, The isomorphism problem for tree-automatic ordinals with addition, The ordinal generated by an ordinal grammar is computable, Isomorphisms of scattered automatic linear orders, Injection Structures Specified by Finite State Transducers, Automata on Ordinals and Linear Orders, Where Automatic Structures Benefit from Weighted Automata, Model Theoretic Complexity of Automatic Structures (Extended Abstract), Unary Automatic Graphs: An Algorithmic Perspective, Automata Presenting Structures: A Survey of the Finite String Case, Some natural decision problems in automatic graphs, Unary automatic graphs: an algorithmic perspective
