On 2-state Mealy automata of polynomial growth

We consider the sequence of 2-state Mealy automata over the finite alphabets, that have polynomial growth orders and define the infinitely presented automatic transformation
 semigroups.

Збережено в:
Бібліографічні деталі
Опубліковано в: :Algebra and Discrete Mathematics
Дата:2003
Автор: Reznykov, I.I.
Формат: Стаття
Мова:Англійська
Опубліковано: Інститут прикладної математики і механіки НАН України 2003
Онлайн доступ:https://nasplib.isofts.kiev.ua/handle/123456789/155702
Теги: Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
Назва журналу:Digital Library of Periodicals of National Academy of Sciences of Ukraine
Цитувати:On 2-state Mealy automata of polynomial growth / I.I. Reznykov // Algebra and Discrete Mathematics. — 2003. — Vol. 2, № 4. — С. 66–85. — Бібліогр.: 20 назв. — англ.

Репозитарії

Digital Library of Periodicals of National Academy of Sciences of Ukraine
_version_ 1862733686384885760
author Reznykov, I.I.
author_facet Reznykov, I.I.
citation_txt On 2-state Mealy automata of polynomial growth / I.I. Reznykov // Algebra and Discrete Mathematics. — 2003. — Vol. 2, № 4. — С. 66–85. — Бібліогр.: 20 назв. — англ.
collection DSpace DC
container_title Algebra and Discrete Mathematics
description We consider the sequence of 2-state Mealy automata over the finite alphabets, that have polynomial growth orders and define the infinitely presented automatic transformation
 semigroups.
first_indexed 2025-12-07T19:38:48Z
format Article
fulltext
id nasplib_isofts_kiev_ua-123456789-155702
institution Digital Library of Periodicals of National Academy of Sciences of Ukraine
issn 1726-3255
language English
last_indexed 2025-12-07T19:38:48Z
publishDate 2003
publisher Інститут прикладної математики і механіки НАН України
record_format dspace
spelling Reznykov, I.I.
2019-06-17T10:56:56Z
2019-06-17T10:56:56Z
2003
On 2-state Mealy automata of polynomial growth / I.I. Reznykov // Algebra and Discrete Mathematics. — 2003. — Vol. 2, № 4. — С. 66–85. — Бібліогр.: 20 назв. — англ.
1726-3255
2000 Mathematics Subject Classification: 68Q70, 20M35.
https://nasplib.isofts.kiev.ua/handle/123456789/155702
We consider the sequence of 2-state Mealy automata over the finite alphabets, that have polynomial growth orders and define the infinitely presented automatic transformation
 semigroups.
en
Інститут прикладної математики і механіки НАН України
Algebra and Discrete Mathematics
On 2-state Mealy automata of polynomial growth
Article
published earlier
spellingShingle On 2-state Mealy automata of polynomial growth
Reznykov, I.I.
title On 2-state Mealy automata of polynomial growth
title_full On 2-state Mealy automata of polynomial growth
title_fullStr On 2-state Mealy automata of polynomial growth
title_full_unstemmed On 2-state Mealy automata of polynomial growth
title_short On 2-state Mealy automata of polynomial growth
title_sort on 2-state mealy automata of polynomial growth
url https://nasplib.isofts.kiev.ua/handle/123456789/155702
work_keys_str_mv AT reznykovii on2statemealyautomataofpolynomialgrowth