Fundamental groups,inverse schützenberger automata,and monoid presentations
DOI10.1080/00927870008827152zbMATH Open0982.20052OpenAlexW2049660505MaRDI QIDQ4519209FDOQ4519209
Publication date: 7 April 2002
Published in: Communications in Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00927870008827152
idempotentsfundamental groupsmonoid presentationsinverse monoidsSchützenberger automatastrongly connected inverse automata
Free semigroups, generators and relations, word problems (20M05) General structure theory for semigroups (20M10) Inverse semigroups (20M18) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Topology of finite graphs
- THE PRO-p TOPOLOGY OF A FREE GROUP AND ALGORITHMIC PROBLEMS IN SEMIGROUPS
- Presentations of inverse monoids
- FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
- Monoid kernels and profinite topologies on the free Abelian group
- Characterizations of Schützenberger graphs in terms of their automorphism groups and fundamental groups
Cited In (8)
- Contractive presentations: A family of inverse monoids and semigroups with finite \({\mathcal R}\)-classes
- The uniform word problem for groups and finite Rees quotients of \(E\)-unitary inverse semigroups
- On finite presentability of monoids and their Schützenberger groups
- Group presentations, formal languages and characterizations of one- counter groups
- Suffix-connected languages
- Title not available (Why is that?)
- Semigroup actions, covering spaces and Schützenberger groups.
- COMBINATORIAL GROUP THEORY, INVERSE MONOIDS, AUTOMATA, AND GLOBAL SEMIGROUP THEORY
This page was built for publication: Fundamental groups,inverse schützenberger automata,and monoid presentations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4519209)
