AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES

@article{Bazhenov2019AUTOMATICAP,
  title={AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES},
  author={Nikolay Bazhenov and Matthew Harrison-Trainor and Iskander Sh. Kalimullin and Alexander G. Melnikov and Keng Meng Ng},
  journal={The Journal of Symbolic Logic},
  year={2019},
  volume={84},
  pages={1630 - 1669}
}
Abstract A structure is automatic if its domain, functions, and relations are all regular languages. Using the fact that every automatic structure is decidable, in the literature many decision problems have been solved by giving an automatic presentation of a particular structure. Khoussainov and Nerode asked whether there is some way to tell whether a structure has, or does not have, an automatic presentation. We answer this question by showing that the set of Turing machines that represent… 
Definable Subsets of Polynomial-Time Algebraic Structures
TLDR
It is proved that up to isomorphism, the algebras B(S), where S is a polynomial-time structure, are precisely computable atomic Boolean algebrae, associated with S.
Non-density in punctual computability
PUNCTUAL CATEGORICITY AND UNIVERSALITY
TLDR
It is proved that every punctually categorical structure in a finite unary language is ${\text {PA}}(0')$-categorical, and it is shown that this upper bound is tight.
A NOTE ON DECIDABLE CATEGORICITY AND INDEX SETS
A structure S is decidably categorical if S has a decidable copy, and for any decidable copies A and B of S, there is a computable isomorphism from A onto B. Goncharov and Marchuk proved that the
Automatic Structures: Twenty Years Later
TLDR
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.
Rogers semilattices of punctual numberings
The paper works within the framework of punctual computability, which is focused on eliminating unbounded search from constructions in algebra and infinite combinatorics. We study punctual
Effective Categoricity of Automatic Equivalence and Nested Equivalence Structures
TLDR
It is shown that any two automatic equivalence structures which are isomorphic are in fact computably isomorphic and that for certain characters, there is always a exponential time isomorphism between two automatic interchange structures with that character.
Categorical linearly ordered structures
Foundations of Online Structure Theory II: The Operator Approach
TLDR
A view that online algorithms can be viewed as a sub-area of computable analysis is begun, and a new framework for online structure theory is introduced.
...
...

References

SHOWING 1-10 OF 84 REFERENCES
Automatic structures
  • Achim Blumensath, E. Grädel
  • Computer Science
    Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)
  • 2000
TLDR
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.
Automatic Presentations for Finitely Generated Groups
TLDR
A complete characterization in the case of finitely generated groups is given and it is shown that such a group has an automatic presentation if and only if it is virtually abelian.
Advice Automatic Structures and Uniformly Automatic Classes
TLDR
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.
Polynomial-Time versus Recursive Models
Every Recursive Linear Ordering Has a Copy in DTIME-SPACE(n, log(n))
TLDR
Patrick Dehornoy's result to all recursive total orderings over N is extended to get minimal complexity for both time and space simultaneously and the isomorphism type of α is not changed if points are replaced by arbitrary finite nonempty subsets of consecutive points.
Logic Colloquium 2007: Three lectures on automatic structures
This paper grew out of three tutorial lectures on automatic structures given by the first author at the Logic Colloquium 2007. We discuss variants of automatic structures related to several models of
Semiautomatic Structures
TLDR
It is shown that one can find semiautomatic representations for the field of rationals and also for finite algebraic field extensions of it and that infinite algebraic extensions of finite fields have semiaUTomatic representations in which the addition and equality are both automatic.
There is no classification of the decidably presentable structures
TLDR
There is no reasonable classification of the decidably presentable structures and it is shown that the index set of the computable structures with decidable presentations is [Formula: see text]-complete.
...
...