Automaton extensions of mappings on the set of words defined by finite Mealy automata
Algebra and discrete mathematics, no. 4 (2005), pp. 36-47
Voir la notice de l'article provenant de la source Math-Net.Ru
The properties of an automaton extensions of mappings on the set of words over a finite alphabet is discussed. We obtain the criterion whether the automaton extension of given mapping if defined by a finite automaton.
Keywords:
automaton mapping, Mealy automato.
@article{ADM_2005_4_a3,
author = {Miros{\l}aw Osys},
title = {Automaton extensions of mappings on the set of words defined by finite {Mealy} automata},
journal = {Algebra and discrete mathematics},
pages = {36--47},
publisher = {mathdoc},
number = {4},
year = {2005},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ADM_2005_4_a3/}
}
Mirosław Osys. Automaton extensions of mappings on the set of words defined by finite Mealy automata. Algebra and discrete mathematics, no. 4 (2005), pp. 36-47. http://geodesic.mathdoc.fr/item/ADM_2005_4_a3/