Article
Licensed
Unlicensed
Requires Authentication
Automaton representation of a free group
-
S. V. Aleshin
Published/Copyright:
November 15, 2011
Abstract
We suggest a new example of a free subgroup of a group of automaton substitutions. We present two automata with three states which generate this subgroup; the inner semigroups of these automata are not groups.
Received: 2011-03-01
Published Online: 2011-11-15
Published in Print: 2011-November
© de Gruyter 2011
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Some nonequiprobable models of random permutations
- Automaton representation of a free group
- On estimation of the number of graphs in some hereditary classes
- An asymptotic upper bound for the chromatic index of random hypergraphs
- On stability of the gradient algorithm in convex discrete optimisation problems and related questions
- Rings over which all modules are completely integrally closed
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
Articles in the same Issue
- Some nonequiprobable models of random permutations
- Automaton representation of a free group
- On estimation of the number of graphs in some hereditary classes
- An asymptotic upper bound for the chromatic index of random hypergraphs
- On stability of the gradient algorithm in convex discrete optimisation problems and related questions
- Rings over which all modules are completely integrally closed
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
