On 2-state Mealy automata of polynomial growth

dc.contributor.author	Reznykov, I.I.
dc.date.accessioned	2019-06-17T10:56:56Z
dc.date.available	2019-06-17T10:56:56Z
dc.date.issued	2003
dc.identifier.citation	On 2-state Mealy automata of polynomial growth / I.I. Reznykov // Algebra and Discrete Mathematics. — 2003. — Vol. 2, № 4. — С. 66–85. — Бібліогр.: 20 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2000 Mathematics Subject Classification: 68Q70, 20M35.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/155702
dc.description.abstract	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.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	On 2-state Mealy automata of polynomial growth	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA