Add to ORKGAbstract. An automatic presentation of a relational structure is, informally, a representation of the elements of that structure by means of a regular language such that the relations can all be recognized by finite automata. This paper shows that a finitely generated cancellative semigroup admits an automatic presentation if and only if it is a subsemigroup of a virtually abelian group.
It is known that, for semigroups, the property of admitting a finite presentation is preserved on pa...
The work at hand studies the possibilities and limitations of the use of finite automata in the desc...
The work at hand studies the possibilities and limitations of the use of finite automata in the desc...
This paper studies FA-presentable structures and gives a complete classification of the finitely gen...
An automatic presentation for a relational structure is, informally, an abstract representation of t...
AbstractThis paper applies the concept of FA-presentable structures to semigroups. We give a complet...
This paper applies the concept of FA-presentable structures to semigroups. We give a complete classi...
Effectively deciding the satisfiability of logical sentences over structures is an area well-studied...
Via an encoding of the Modified Post's Correspondence Problem, this paper shows that it is undecidab...
We study the existence of automatic presentations for various algebraic structures. An automatic pre...
Automatic presentations, also called FA-presentations, were introduced to extend nite model theory t...
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 ...
This thesis studies subsemigroups of groups from three perspectives: automatic structures, ordinary ...
AbstractThe area of automatic groups has been one in which significant advances have been made in re...
It is known that, for semigroups, the property of admitting a finite presentation is preserved on pa...
The work at hand studies the possibilities and limitations of the use of finite automata in the desc...
The work at hand studies the possibilities and limitations of the use of finite automata in the desc...
This paper studies FA-presentable structures and gives a complete classification of the finitely gen...
An automatic presentation for a relational structure is, informally, an abstract representation of t...
AbstractThis paper applies the concept of FA-presentable structures to semigroups. We give a complet...
This paper applies the concept of FA-presentable structures to semigroups. We give a complete classi...
Effectively deciding the satisfiability of logical sentences over structures is an area well-studied...
Via an encoding of the Modified Post's Correspondence Problem, this paper shows that it is undecidab...
We study the existence of automatic presentations for various algebraic structures. An automatic pre...
Automatic presentations, also called FA-presentations, were introduced to extend nite model theory t...
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 ...
This thesis studies subsemigroups of groups from three perspectives: automatic structures, ordinary ...
AbstractThe area of automatic groups has been one in which significant advances have been made in re...
It is known that, for semigroups, the property of admitting a finite presentation is preserved on pa...
The work at hand studies the possibilities and limitations of the use of finite automata in the desc...
The work at hand studies the possibilities and limitations of the use of finite automata in the desc...