Fundamental groups,inverse schützenberger automata,and monoid presentations

DOI10.1080/00927870008827152zbMath0982.20052OpenAlexW2049660505MaRDI QIDQ4519209

Benjamin Steinberg

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

zbMATH Keywords

idempotentsfundamental groupsinverse monoidsmonoid presentationsSchützenberger automatastrongly connected inverse automata

Mathematics Subject Classification ID

General structure theory for semigroups (20M10) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Inverse semigroups (20M18)

Related Items (4)

COMBINATORIAL GROUP THEORY, INVERSE MONOIDS, AUTOMATA, AND GLOBAL SEMIGROUP THEORY ⋮ Suffix-connected languages ⋮ The uniform word problem for groups and finite Rees quotients of \(E\)-unitary inverse semigroups ⋮ Semigroup actions, covering spaces and Schützenberger groups.

Cites Work

• Presentations of inverse monoids
• Topology of finite graphs
• FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
• Characterizations of Schützenberger graphs in terms of their automorphism groups and fundamental groups
• THE PRO-p TOPOLOGY OF A FREE GROUP AND ALGORITHMIC PROBLEMS IN SEMIGROUPS
• Monoid kernels and profinite topologies on the free Abelian group

This page was built for publication: Fundamental groups,inverse schützenberger automata,and monoid presentations