# Structures without Scattered-Automatic Presentation

@article{Kartzow2013StructuresWS, title={Structures without Scattered-Automatic Presentation}, author={Alexander Kartzow and Philipp Schlicht}, journal={ArXiv}, year={2013}, volume={abs/1304.0912} }

Bruyere and Carton lifted the notion of finite automata reading infinite words to finite automata reading words with shape an arbitrary linear order \(\mathfrak{L}\). Automata on finite words can be used to represent infinite structures, the so-called word-automatic structures. Analogously, for a linear order \(\mathfrak{L}\) there is the class of \(\mathfrak{L}\)-automatic structures. In this paper we prove the following limitations on the class of \(\mathfrak{L}\)-automatic structures for a… Expand

#### Topics from this paper

#### 6 Citations

The Field of the Reals and the Random Graph are not Finite-Word Ordinal-Automatic

- Computer Science, Mathematics
- J. Autom. Lang. Comb.
- 2016

This work lifts Delhomm\'e's relative-growth-technique from the automatic and tree-automatic setting to the ordinal- automatic setting, which implies that the random graph is not Ordinal-automatic and infinite integral domains are not ordinals below $\omega_1+\omega^ \omega$ where $\omegas_1$ is the first uncountable ordinal. Expand

Second-Order Finite Automata

- Computer Science
- CSR
- 2020

It is shown that sets of sets of strings represented by second-order finite automata are closed under the usual Boolean operations, such as union, intersection, difference and even under a suitable notion of complementation, and emptiness of intersection and inclusion are decidable. Expand

Advice Automatic Structures and Uniformly Automatic Classes

- Computer Science
- CSL
- 2017

It is proved that the class of all torsion-free Abelian groups of rank one is uniformly omega-automatic and that there is a uniform omega-tree-automatic presentation of the classof all Abelian Groups up to elementary equivalence and of theclass of all countable divisible Abelian Group groups. Expand

Pumping for ordinal-automatic structures

- Mathematics, Computer Science
- Comput.
- 2017

A pumping lemma for alpha-automata (processing finite alpha-words, i.e., words of length alpha that have one fixed letter at all but finitely many positions) is developed and a sharp bound on the height of the finite word alpha-automatic well-founded order forests is provided. Expand

Algorithmic Solutions via Model Theoretic Interpretations

- Mathematics
- 2017

Model theoretic interpretations are an important tool in algorithmic model theory. Their applications range from reductions between logical theories to the construction of algorithms for problems,… Expand

Automatic Structures: Twenty Years Later

- Computer Science, Mathematics
- LICS
- 2020

This tutorial presents an introduction into the history and basic definitions of automatic structures, and surveys the achievements in the study of different variants ofautomatic structures. Expand

#### References

SHOWING 1-10 OF 25 REFERENCES

Complementation of rational sets on countable scattered linear orderings

- Mathematics, Computer Science
- Int. J. Found. Comput. Sci.
- 2005

It is proved that rational sets of words on countable scattered linear orderings are closed under complementation using an algebraic approach. Expand

Automata-based presentations of infinite structures

- Mathematics, Computer Science
- Finite and Algorithmic Model Theory
- 2011

Algorithmic model theory aims to extend in a systematic fashion the approach and methods of finite model theory, and its interactions with computer science, from finite structures to finitely-presentable infinite ones. Expand

Automatic structures

- Computer Science
- Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)
- 2000

This work determines the complexity of model checking and query evaluation on automatic structures for fragments of first-order logic and gives model-theoretic characterisations for automatic structures via interpretations. Expand

Automatic linear orders and trees

- Mathematics, Computer Science
- TOCL
- 2005

It is shown that every infinite path in an automatic tree with countably many infinite paths is a regular language. Expand

Automata on ordinals and automaticity of linear orders

- Mathematics, Computer Science
- Ann. Pure Appl. Log.
- 2013

A method for proving non-automaticity is described and this is applied to determine the optimal bounds for the ranks of linear orders recognized by finite state automata. Expand

Automatic structures: richness and limitations

- Computer Science, Mathematics
- Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
- 2004

It is proven that the free Abelian group of infinite rank and many Fraisse limits do not have automatic presentations, and the complexity of the isomorphism problem for the class of all automatic structures is /spl Sigma//sub 1//sup 1/-complete. Expand

Model-theoretic complexity of automatic structures

- Mathematics, Computer Science
- Ann. Pure Appl. Log.
- 2009

The following results are proved: The ordinal height of any automatic well-founded partial order is bounded by ωω, and the ordinal heights of automaticWell-founded relations are unbounded below (ω1CK). Expand

The Rank of Tree-Automatic Linear Orderings

- Mathematics, Computer Science
- STACS
- 2013

It is proved that the FC-rank of every tree-automatic linear ordering is below omega^omega, and an analogue for tree- automatic linear orderings where the branching complexity of the trees involved is bounded is shown. Expand

The isomorphism problem on classes of automatic structures with transitive relations

- Mathematics
- 2013

Automatic structures are finitely presented structures where the universe and all relations can be recognized by finite automata. It is known that the isomorphism problem for automatic structures is… Expand

Automata on linear orderings

- Computer Science, Mathematics
- J. Comput. Syst. Sci.
- 2007

It is proved that for countable scattered linear orderings, the two notions of finite automata and rational expressions are equivalent, which extends Kleene's theorem. Expand