Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable

DOI10.1007/978-3-642-30870-3_32zbMath1358.03047arXiv1201.5070OpenAlexW117834157MaRDI QIDQ2904421

Martin Huschenbett

Publication date: 14 August 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.5070

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Computable structure theory, computable model theory (03C57)

Related Items (2)

Tree-automatic scattered linear orders ⋮ Tree-Automatic Well-Founded Trees

This page was built for publication: Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable