Add to ORKGInternational audienceThis article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has exactly this degree
To each one-dimensional subshift X, we may associate a winning shift W(X) which arises from a combin...
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
International audienceThis article studies the complexity of the word problem in groups of automorph...
International audienceThis article studies the complexity of the word problem in groups of automorph...
Artículo de publicación ISIIn this article, we study the automorphism group Aut.X; / of subshifts ....
Artículo de publicación ISIIn this article, we study the automorphism group Aut.X; / of subshifts ....
International audienceWe generalize the classical definition of effectively closed subshift to finit...
We construct an automaton group with a PSPACE-complete word problem, proving a conjecture due to Ste...
International audienceWe generalize the classical definition of effectively closed subshift to finit...
Subshifts are sets of colorings of Z^d by a finite alphabet that avoid some family of forbidden patt...
We prove that for any transitive subshift X with word complexity function cn(X), if lim inf(log(cn(X...
We prove that for any transitive subshift X with word complexity function cn(X), if lim inf(log(cn(X...
We prove that for any transitive subshift X with word complexity function cn(X), if lim inf(log(cn(X...
International audienceIn this article, we study the automorphism group Aut(X, sigma) of subshifts (X...
To each one-dimensional subshift X, we may associate a winning shift W(X) which arises from a combin...
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
International audienceThis article studies the complexity of the word problem in groups of automorph...
International audienceThis article studies the complexity of the word problem in groups of automorph...
Artículo de publicación ISIIn this article, we study the automorphism group Aut.X; / of subshifts ....
Artículo de publicación ISIIn this article, we study the automorphism group Aut.X; / of subshifts ....
International audienceWe generalize the classical definition of effectively closed subshift to finit...
We construct an automaton group with a PSPACE-complete word problem, proving a conjecture due to Ste...
International audienceWe generalize the classical definition of effectively closed subshift to finit...
Subshifts are sets of colorings of Z^d by a finite alphabet that avoid some family of forbidden patt...
We prove that for any transitive subshift X with word complexity function cn(X), if lim inf(log(cn(X...
We prove that for any transitive subshift X with word complexity function cn(X), if lim inf(log(cn(X...
We prove that for any transitive subshift X with word complexity function cn(X), if lim inf(log(cn(X...
International audienceIn this article, we study the automorphism group Aut(X, sigma) of subshifts (X...
To each one-dimensional subshift X, we may associate a winning shift W(X) which arises from a combin...
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...