Free products of semigroups defined by automata
Abstract
It is shown that the free product of semigroups defined by (finite) automata over a finite alphabet is defined by (finite) automata over the same alphabet.
Keywords
free product of semigroups, finite automaton, group defined by automata
Full Text:
PDFDOI: http://dx.doi.org/10.12958/adm2371
Refbacks
- There are currently no refbacks.