Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable
A tree automatic structure is a structure whose domain can be encoded by a regular tree language such that each relation is recognisable by a finite automaton processing tuples of trees synchronously. Words can be regarded as specific simple trees and a structure is word automatic if it is encodable using only these trees. The question naturally arises whether a given tree automatic structure is already word automatic. We prove that this problem is decidable for tree automatic scattered linear orderings. Moreover, we show that in case of a positive answer a word automatic presentation is computable from the tree automatic presentation.
KeywordsIsomorphism Problem Tree Automaton Tree Language Automatic Structure Tree Domain
Unable to display preview. Download preview PDF.
- 1.Bárány, V., Grädel, E., Rubin, S.: Automata-based presentations of infinite structures. In: Esparza, J., Michaux, C., Steinhorn, C. (eds.) Finite and Algorithmic Model Theory, pp. 1–76. Cambridge University Press (2011)Google Scholar
- 2.Blumensath, A.: Automatic structures. Diploma thesis, RWTH Aachen (1999)Google Scholar
- 7.Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 384–455. Springer, Heidelberg (1997)Google Scholar