Automaton extensions of mappings on the set of words defined by finite Mealy automata
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.
Gespeichert in:
| Datum: | 2005 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | English |
| Veröffentlicht: |
Інститут прикладної математики і механіки НАН України
2005
|
| Schriftenreihe: | Algebra and Discrete Mathematics |
| Online Zugang: | http://dspace.nbuv.gov.ua/handle/123456789/157337 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Zitieren: | Automaton extensions of mappings on the set of words defined by finite Mealy automata / M. Osys // Algebra and Discrete Mathematics. — 2005. — Vol. 4, № 4. — С. 36–47. — Бібліогр.: 7 назв. — англ. |