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.
Збережено в:
| Опубліковано в: : | Algebra and Discrete Mathematics |
|---|---|
| Дата: | 2005 |
| Автор: | |
| Формат: | Стаття |
| Мова: | Англійська |
| Опубліковано: |
Інститут прикладної математики і механіки НАН України
2005
|
| Онлайн доступ: | https://nasplib.isofts.kiev.ua/handle/123456789/157337 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Цитувати: | 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 назв. — англ. |
Репозитарії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| _version_ | 1862722206610489344 |
|---|---|
| author | Osys, M. |
| author_facet | Osys, M. |
| citation_txt | 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 назв. — англ. |
| collection | DSpace DC |
| container_title | Algebra and Discrete Mathematics |
| description | 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.
|
| first_indexed | 2025-12-07T18:34:13Z |
| format | Article |
| fulltext | |
| id | nasplib_isofts_kiev_ua-123456789-157337 |
| institution | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| issn | 1726-3255 |
| language | English |
| last_indexed | 2025-12-07T18:34:13Z |
| publishDate | 2005 |
| publisher | Інститут прикладної математики і механіки НАН України |
| record_format | dspace |
| spelling | Osys, M. 2019-06-20T02:31:26Z 2019-06-20T02:31:26Z 2005 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 назв. — англ. 1726-3255 2000 Mathematics Subject Classification: 68Q70, 68Q45. https://nasplib.isofts.kiev.ua/handle/123456789/157337 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. Thanks to Vitalii Sushchanskii for his kindness and for invaluable help. en Інститут прикладної математики і механіки НАН України Algebra and Discrete Mathematics Automaton extensions of mappings on the set of words defined by finite Mealy automata Article published earlier |
| spellingShingle | Automaton extensions of mappings on the set of words defined by finite Mealy automata Osys, M. |
| title | Automaton extensions of mappings on the set of words defined by finite Mealy automata |
| title_full | Automaton extensions of mappings on the set of words defined by finite Mealy automata |
| title_fullStr | Automaton extensions of mappings on the set of words defined by finite Mealy automata |
| title_full_unstemmed | Automaton extensions of mappings on the set of words defined by finite Mealy automata |
| title_short | Automaton extensions of mappings on the set of words defined by finite Mealy automata |
| title_sort | automaton extensions of mappings on the set of words defined by finite mealy automata |
| url | https://nasplib.isofts.kiev.ua/handle/123456789/157337 |
| work_keys_str_mv | AT osysm automatonextensionsofmappingsonthesetofwordsdefinedbyfinitemealyautomata |