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.
Saved in:
| Date: | 2005 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2005
|
| Series: | Algebra and Discrete Mathematics |
| Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/157337 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | 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 назв. — англ. |