RESEARCH ARTICLE

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

Mirosław Osys

Silesian University of Technology, Faculty of Mathematics and Physics, ul. Kaszubska 23, 44–100 Gliwice, Poland

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 automato.

MSC: 68Q70, 68Q45

Received: 29.10.2004
Revised: 15.12.2005

Language: English

Bibliographic databases:

• 
•