Article
Licensed
Unlicensed
Requires Authentication
The automaton permutation group ASn is generated by elements of infinite order
-
V. V. MAKAROV
Published/Copyright:
October 9, 2009
Published Online: 2009-10-09
Published in Print: 1997
Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On transformations of sets of words over a finite alphabet which do not propagate errors
- The automaton permutation group ASn is generated by elements of infinite order
- On domains completely specifying Boolean functions
- Critical branching processes in random environment: the probability of extinction at a given moment
- A new theorem for a critical branching process in random environment
- Limit distributions of the number of vertices in the layers of a random forest
- The sequential chi-square test based on s-tuples of states of a Markov chain
- Decomposable statistics in the scheme of allocating distinguishable and indistinguishable particles to distinguishable cells
Articles in the same Issue
- On transformations of sets of words over a finite alphabet which do not propagate errors
- The automaton permutation group ASn is generated by elements of infinite order
- On domains completely specifying Boolean functions
- Critical branching processes in random environment: the probability of extinction at a given moment
- A new theorem for a critical branching process in random environment
- Limit distributions of the number of vertices in the layers of a random forest
- The sequential chi-square test based on s-tuples of states of a Markov chain
- Decomposable statistics in the scheme of allocating distinguishable and indistinguishable particles to distinguishable cells
