# Advice Automatic Structures and Uniformly Automatic Classes

@inproceedings{Zaid2017AdviceAS, title={Advice Automatic Structures and Uniformly Automatic Classes}, author={Faried Abu Zaid and Erich Gr{\"a}del and Frederic Reinhardt}, booktitle={CSL}, year={2017} }

We study structures that are automatic with advice. These are structures that admit a presentation by finite automata (over finite or infinite words or trees) with access to an additional input,called an advice. Over finite words, a standard example of a structure that is automatic with advice, but not automatic in the classical sense, is the additive group of rational numbers (Q,+).
By using a set of advices rather than a single advice, this leads to the new concept of a parameterised… Expand

#### Figures and Topics from this paper

#### 7 Citations

On the Complexity of Infinite Advice Strings

- Computer Science
- ICALP
- 2018

The main results explore the connections between classes of advice automatic structures, MSO-transductions and two-way transducers and suggest a closer study of the resulting hierarchy over infinite words. Expand

Uniformly Automatic Classes of Finite Structures

- Computer Science
- FSTTCS
- 2018

A method is developed to analyze the complexity of uniformly tree-automatic presentations, which allows us to give upper bounds for the runtime of the automata-based model checking algorithm on the presented class. Expand

Comparing the power of advice strings: a notion of complexity for infinite words

- Computer Science, Mathematics
- ArXiv
- 2018

The main results explore the connections between classes of advice automatic structures, MSO-transductions and two-way transducers and suggest a closer study of the resulting hierarchy over infinite words. Expand

AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES

- Computer Science, Mathematics
- The Journal of Symbolic Logic
- 2019

This paper shows that the set of Turing machines that represent automata-presentable structures is ${\rm{\Sigma }}_1^1 $-complete and uses similar methods to show that there is no reasonable characterisation of the structures with a polynomial-time presentation in the sense of Nerode and Remmel. 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

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

On the Width of Regular Classes of Finite Structures

- Computer Science, Mathematics
- CADE
- 2019

It is shown that the problem of counting satisfying assignments for a first-order logic formula in a structure of constant width is fixed parameter tractable when parameterized by the width parameter and can be solved in quadratic time with respect to the length of the input representation of the structure. Expand

#### References

SHOWING 1-10 OF 21 REFERENCES

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

Finite Presentations of Infinite Structures:
Automata and Interpretations

- Mathematics, Computer Science
- Theory of Computing Systems
- 2004

The model checking problem for FO(∃ω), first-order logic extended by the quantifier “there are infinitely many”, is proved to be decidable for automatic and ω-automatic structures and appropriate expansions of the real ordered group. 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

Automata Presenting Structures: A Survey of the Finite String Case

- Mathematics, Computer Science
- Bulletin of Symbolic Logic
- 2008

The problems surveyed here include the classification of classes of structures with automatic presentations, the complexity of the isomorphism problem, and the relationship between definability and recognisability. Expand

Describing Groups

- Computer Science
- Bulletin of Symbolic Logic
- 2007

This paper surveys examples of FA-presentable groups, but also discusses theorems restricting this class, and gives examples of quasi-finitely axiomatizable groups, and considers the algebraic content of the notion. Expand

Transforming structures by set interpretations

- Computer Science, Mathematics
- Log. Methods Comput. Sci.
- 2007

This paper investigates the expressive power of finite sets interpretations applied to infinite deterministic trees and finds that they can be used in the study of automatic and tree-automatic structures. Expand

Structures without Scattered-Automatic Presentation

- Mathematics, Computer Science
- CiE
- 2013

This paper proves the following limitations on the class of \(\mathfrak{L}\)-automatic structures for a fixed \(\ mathfrak {L}\) of finite condensation rank 1 + α. Expand

A Myhill-Nerode theorem for automata with advice

- Mathematics, Computer Science
- GandALF
- 2012

The Myhill-Nerode theorem is refined to characterize the languages of finite strings that are accepted by automata with advice that have access to an additional fixed infinite string called an advice tape. Expand

Is Ramsey's theorem omega-automatic?

- Mathematics, Computer Science
- STACS
- 2010

It is shown that every unc Countable omega-automatic graph contains an uncountable co-context-free clique or anticlique, but not necessarily a context-free (let alone regular) clique and anticlique. Expand

The Isomorphism Problem on Classes of Automatic Structures

- Mathematics, Computer Science
- 2010 25th Annual IEEE Symposium on Logic in Computer Science
- 2010

Several new undecidability results on isomorphism problems for automatic structures are shown: (i) The isomorphism problem for automatic equivalence relations is \pi^0_1-complete. (ii) The… Expand