Partial actions and automata

dc.contributor.author	Dokuchaev, M.
dc.contributor.author	Novikov, B.
dc.contributor.author	Zholtkevych, G.
dc.date.accessioned	2019-06-16T05:24:07Z
dc.date.available	2019-06-16T05:24:07Z
dc.date.issued	2011
dc.identifier.citation	Partial actions and automata / M. Dokuchaev, B. Novikov, G. Zholtkevych // Algebra and Discrete Mathematics. — 2011. — Vol. 11, № 2. — С. 51–63. — Бібліогр.: 7 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2000 Mathematics Subject Classification:20M30, 20M35, 68Q70
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/154801
dc.description.abstract	We use the notion of a partial action of a monoid to introduce a generalization of automata, which we call ``a preautomaton''. We study properties of preautomata and of languages recognized by preautomata.	uk_UA
dc.description.sponsorship	This paper was partially supported by CNPq and FAPESP (Brazil).	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	Partial actions and automata	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA