Automatic linear orders and trees
From MaRDI portal
Publication:5277736
DOI10.1145/1094622.1094625zbMath1367.03070OpenAlexW2033186040MaRDI 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
Automata and formal grammars in connection with logical questions (03D05) Total orders (06A05) Computable structure theory, computable model theory (03C57)
Related Items
Tree-automatic scattered linear orders ⋮ Pumping for ordinal-automatic structures1 ⋮ The isomorphism problem for FST injection structures ⋮ Model Theoretic Complexity of Automatic Structures (Extended Abstract) ⋮ Unary Automatic Graphs: An Algorithmic Perspective ⋮ Automata Presenting Structures: A Survey of the Finite String Case ⋮ Model-theoretic complexity of automatic structures ⋮ Injection Structures Specified by Finite State Transducers ⋮ Isomorphisms of scattered automatic linear orders ⋮ Subalgebras of FA-presentable algebras. ⋮ FA-presentable groups and rings ⋮ Some natural decision problems in automatic graphs ⋮ From automatic structures to automatic groups. ⋮ The isomorphism problem for tree-automatic ordinals with addition ⋮ Unary automatic graphs: an algorithmic perspective ⋮ Tree-Automatic Well-Founded Trees ⋮ Automata on Ordinals and Linear Orders ⋮ Where Automatic Structures Benefit from Weighted Automata ⋮ The ordinal generated by an ordinal grammar is computable
This page was built for publication: Automatic linear orders and trees
