Author:
Cutting Andrew,Solomon Andrew
Abstract
AbstractProperties such as automaticity, growth and decidability are investigated for the class of finitely generated semigroups which have regular sets of unique normal forms. Knowledge obtained is then applied to the task of demonstrating that a class of semigroups derived from free inverse semigroups under certain closure operations is not automatic.
Publisher
Cambridge University Press (CUP)
Reference16 articles.
1. On algorithmic problems in effectively complete classes of groups;Adjan;Dokl. Akad. Nauk SSSR,1958
2. Computation with Finitely Presented Groups
3. [2] Campbell C. M. , Robertson E. F. , Ruškuc N. and Thomas R. M. , ‘Automatic semigroups’, Theoret. Comput. Sci. (to appear).
4. GROUPS WITH A RATIONAL CROSS-SECTION
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献