Automaton extensions of mappings on the set of words defined by finite Mealy automata

dc.contributor.author	Osys, M.
dc.date.accessioned	2019-06-20T02:31:26Z
dc.date.available	2019-06-20T02:31:26Z
dc.date.issued	2005
dc.identifier.citation	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 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2000 Mathematics Subject Classification: 68Q70, 68Q45.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/157337
dc.description.abstract	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.	uk_UA
dc.description.sponsorship	Thanks to Vitalii Sushchanskii for his kindness and for invaluable help.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	Automaton extensions of mappings on the set of words defined by finite Mealy automata	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA