Classification of inverse semigroups generated by two-state partially defined invertible automata over the two-symbol alphabet
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.
Saved in:
Date: | 2006 |
---|---|
Main Author: | |
Format: | Article |
Language: | English |
Published: |
Інститут прикладної математики і механіки НАН України
2006
|
Series: | Algebra and Discrete Mathematics |
Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/157367 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
Cite this: | 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 назв. — англ. |