Add to ORKGCharacterizations in terms of formal languages are given for synchronous and asynchronous automatic groups admitting prefix closed automatic structures with uniqueness
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
Abstract The history, denition and principal properties of automatic groups and their generalisation...
The main result of this paper establishes invariance under change of generators for automatic struct...
AbstractAutomatic groups admitting prefix-closed automatic structures with uniqueness are characteri...
In the last several years a remarkable interplay between geometry, group theory, and the theory of f...
AbstractThe area of automatic groups has been one in which significant advances have been made in re...
. A group is combable if it can be represented by a language of words satisfying a fellow traveller ...
AbstractWe consider the automaticity of subsemigroups of free products of semigroups, proving that s...
Abstract. Accessible groups whose word problems are accepted by a deterministic nested stack automat...
Effectively deciding the satisfiability of logical sentences over structures is an area well-studied...
© 2016 Elsevier Inc. Autostackability for finitely presented groups is a topological property of the...
It is well known that recognizability has many algebraic properties. For example, a subset $L$ of th...
AbstractWe consider various automata-theoretic properties of semigroupoids and small categories and ...
We generalize the notion of a graph automatic group introduced by Kharlampovich, Khoussainov and Mia...
We consider various automata-theoretic properties of semigroupoids and small categories and their re...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
Abstract The history, denition and principal properties of automatic groups and their generalisation...
The main result of this paper establishes invariance under change of generators for automatic struct...
AbstractAutomatic groups admitting prefix-closed automatic structures with uniqueness are characteri...
In the last several years a remarkable interplay between geometry, group theory, and the theory of f...
AbstractThe area of automatic groups has been one in which significant advances have been made in re...
. A group is combable if it can be represented by a language of words satisfying a fellow traveller ...
AbstractWe consider the automaticity of subsemigroups of free products of semigroups, proving that s...
Abstract. Accessible groups whose word problems are accepted by a deterministic nested stack automat...
Effectively deciding the satisfiability of logical sentences over structures is an area well-studied...
© 2016 Elsevier Inc. Autostackability for finitely presented groups is a topological property of the...
It is well known that recognizability has many algebraic properties. For example, a subset $L$ of th...
AbstractWe consider various automata-theoretic properties of semigroupoids and small categories and ...
We generalize the notion of a graph automatic group introduced by Kharlampovich, Khoussainov and Mia...
We consider various automata-theoretic properties of semigroupoids and small categories and their re...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
Abstract The history, denition and principal properties of automatic groups and their generalisation...
The main result of this paper establishes invariance under change of generators for automatic struct...