Classification of inverse semigroups generated by two-state partially defined invertible automata over the two-symbol alphabet

dc.contributor.author	Slupik, J.K.
dc.date.accessioned	2019-06-20T03:07:11Z
dc.date.available	2019-06-20T03:07:11Z
dc.date.issued	2006
dc.identifier.citation	Classification of inverse semigroups generated by two-state partially defined invertible automata over the two-symbol alphabet / J.K. Slupik // Algebra and Discrete Mathematics. — 2006. — Vol. 5, № 1. — С. 67–80. — Бібліогр.: 7 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2000 Mathematics Subject Classification: 20M18; 20M35, 68Q35.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/157367
dc.description.abstract	The classification of inverse semigroups generated by two-state partially defined invertible automata over a twosymbol alphabet is investigated. Two presentations of such semigroups are given. The structures of these semigroups are analyzed.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	Classification of inverse semigroups generated by two-state partially defined invertible automata over the two-symbol alphabet	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA