Automaton extensions of mappings on the set of words defined by finite Mealy automata

Miroslaw Osys

Abstract


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 automaton

Full Text:

PDF

Refbacks

  • There are currently no refbacks.