Article ID Journal Published Year Pages File Type
10333924 Theoretical Computer Science 2011 12 Pages PDF
Abstract
In the paper, we deal with the notion of an automaton over a changing alphabet, which generalizes the concept of a Mealy-type automaton. We modify the methods based on the idea of a dual automaton and its action used by B. Steinberg et al. (2011) and M. Vorobets and Ya. Vorobets (2007, 2010) [16], [17], [18] and adapt them to automata over a changing alphabet. We show that this modification provides some naturally defined automaton representations of a free nonabelian group by a 2-state automaton over a changing alphabet.
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
,