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: | 2018 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2018
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/944 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |