Add to ORKGCopyright © The Association for Symbolic Logic 2019. 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 automata-presentable structures is-complete. We also use similar methods to show that there is no reasonable characterisation of the structures with a polynomial-time presentation in the sense of Nerode and Re...
Given a countable algebraic structure B with no degree we find sufficient conditions for the existen...
A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own ...
We employ an algebraic method for comparing the structural simplicity of families of abstract machin...
Copyright © The Association for Symbolic Logic 2019. A structure is automatic if its domain, functio...
A structure is automatic if its domain, functions, and relations are all regular languages. Using th...
We study the existence of automatic presentations for various algebraic structures. An automatic pre...
M.Sc.In this thesis we study some of the propertie of a clas called automatic structures. Automatic ...
Automatic structures are countable structures finitely presentable by a collection of automata. We s...
Automatic structures are countable structures finitely presentable by a collection of automata. We ...
The work at hand studies the possibilities and limitations of the use of finite automata in the desc...
Finite state automata are Turing machines with fixed finite bounds on resource use. Automata lend t...
We describe all possible relations between certain reducibities of algebraic structures which are ba...
Abstract. This paper addresses the complexity of several families of queries in classes of unary aut...
Effectively deciding the satisfiability of logical sentences over structures is an area well-studied...
The work at hand studies the possibilities and limitations of the use of finite automata in the desc...
Given a countable algebraic structure B with no degree we find sufficient conditions for the existen...
A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own ...
We employ an algebraic method for comparing the structural simplicity of families of abstract machin...
Copyright © The Association for Symbolic Logic 2019. A structure is automatic if its domain, functio...
A structure is automatic if its domain, functions, and relations are all regular languages. Using th...
We study the existence of automatic presentations for various algebraic structures. An automatic pre...
M.Sc.In this thesis we study some of the propertie of a clas called automatic structures. Automatic ...
Automatic structures are countable structures finitely presentable by a collection of automata. We s...
Automatic structures are countable structures finitely presentable by a collection of automata. We ...
The work at hand studies the possibilities and limitations of the use of finite automata in the desc...
Finite state automata are Turing machines with fixed finite bounds on resource use. Automata lend t...
We describe all possible relations between certain reducibities of algebraic structures which are ba...
Abstract. This paper addresses the complexity of several families of queries in classes of unary aut...
Effectively deciding the satisfiability of logical sentences over structures is an area well-studied...
The work at hand studies the possibilities and limitations of the use of finite automata in the desc...
Given a countable algebraic structure B with no degree we find sufficient conditions for the existen...
A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own ...
We employ an algebraic method for comparing the structural simplicity of families of abstract machin...