Article contents
The automata theory of semigroup embeddings
Published online by Cambridge University Press: 09 April 2009
Abstract
The theorem of Trevor Evans [1] that every countable semigroup can be embedded in a two-generator semigroup becomes obvious in automata theory as the statement that every countable automaton can be embedded in one with binary inputs. Standard techniques of automata theory [1], [3] yield a proof of the Evans Theorem using wreath products, as in Neumann [4].
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1968
References
- 3
- Cited by