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.
Збережено в:
| Дата: | 2005 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Інститут прикладної математики і механіки НАН України
2005
|
| Назва видання: | Algebra and Discrete Mathematics |
| Онлайн доступ: | http://dspace.nbuv.gov.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| id |
irk-123456789-157337 |
|---|---|
| record_format |
dspace |
| spelling |
irk-123456789-1573372019-06-21T01:27:14Z Automaton extensions of mappings on the set of words defined by finite Mealy automata Osys, M. 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. 2005 Article 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. http://dspace.nbuv.gov.ua/handle/123456789/157337 en Algebra and Discrete Mathematics Інститут прикладної математики і механіки НАН України |
| institution |
Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| collection |
DSpace DC |
| language |
English |
| 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. |
| format |
Article |
| author |
Osys, M. |
| spellingShingle |
Osys, M. Automaton extensions of mappings on the set of words defined by finite Mealy automata Algebra and Discrete Mathematics |
| author_facet |
Osys, M. |
| author_sort |
Osys, M. |
| title |
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_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_sort |
automaton extensions of mappings on the set of words defined by finite mealy automata |
| publisher |
Інститут прикладної математики і механіки НАН України |
| publishDate |
2005 |
| url |
http://dspace.nbuv.gov.ua/handle/123456789/157337 |
| 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 назв. — англ. |
| series |
Algebra and Discrete Mathematics |
| work_keys_str_mv |
AT osysm automatonextensionsofmappingsonthesetofwordsdefinedbyfinitemealyautomata |
| first_indexed |
2023-05-20T17:51:48Z |
| last_indexed |
2023-05-20T17:51:48Z |
| _version_ |
1796154259476054016 |