Fundamental groups,inverse schützenberger automata,and monoid presentations
作者:
Benjamin Steinberg,
期刊:
Communications in Algebra
(Taylor Available online 2000)
卷期:
Volume 28,
issue 11
页码: 5235-5253
ISSN:0092-7872
年代: 2000
DOI:10.1080/00927870008827152
出版商: Gordon and Breach Science Publishers Ltd.
关键词: Fundamental groups;Schützenberger automata;rational languages;automata;inverse monoids;Cayley graphs;decidability;20M18;20M35;20F10
数据来源: Taylor
摘要:
This paper gives decidable conditions for when a finitely generated subgroup of a free group is the fundamental group of a Schützenberger automaton corresponding to a monoid presentation of an inverse monoid. Also, generalizations are given to specific types of inverse monoids as well as to monoids which are "nearly inverse." This result has applications to computing membership for inverse monoids in a Mal'cev product of the pseudovariety of semilattices with a pseudovariety of groups.
点击下载:
PDF (1102KB)
返 回