The uniform word problem for groups and finite Rees quotients of \(E\)-unitary inverse semigroups

DOI10.1016/S0021-8693(03)00312-0zbMath1031.20048MaRDI QIDQ1403857

Benjamin Steinberg

Publication date: 20 August 2003

Published in: Journal of Algebra (Search for Journal in Brave)

zbMATH Keywords

Cayley graphsdecidabilitypseudovarieties of finite groupsSchützenberger graphsRees quotientsfinite groupoidsuniform word problem\(E\)-unitary inverse semigroupsfinite cancellative categories

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Quasivarieties and varieties of groups (20E10) Inverse semigroups (20M18)

Related Items (7)

PRESENTATIONS OF INVERSE SEMIGROUPS, THEIR KERNELS AND EXTENSIONS ⋮ UNDECIDABILITY AND THE DEVELOPABILITY OF PERMUTOIDS AND RIGID PSEUDOGROUPS ⋮ \(E^*\)-dense \(E\)-semigroups. ⋮ FAITHFUL FUNCTORS FROM CANCELLATIVE CATEGORIES TO CANCELLATIVE MONOIDS WITH AN APPLICATION TO ABUNDANT SEMIGROUPS ⋮ The geometry of profinite graphs with applications to free groups and finite monoids ⋮ GRAPH PRODUCTS OF RIGHT CANCELLATIVE MONOIDS ⋮ A CORRESPONDENCE BETWEEN BALANCED VARIETIES AND INVERSE MONOIDS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Presentations of inverse monoids
• Unsolvability of the universal theory of finite groups
• Topology of finite graphs
• Algorithmic problems for finite groups and finite \(0\)-simple semigroups
• Finite state automata: A geometric approach
• THE WORD PROBLEM FOR SOLVABLE LIE ALGEBRAS AND GROUPS
• Inverse Monoids, Trees, and Context-Free Languages
• Groups, Semilattices and Inverse Semigroups. II
• Characterizations of Schützenberger graphs in terms of their automorphism groups and fundamental groups
• UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
• Fundamental groups,inverse schützenberger automata,and monoid presentations
• Inverse automata and monoids and the undecidability of the cayley subgraph problem for groups
• Potential Divisibility in Finite Semigroups is Undecidable
• CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
• COMBINATORIAL GROUP THEORY, INVERSE MONOIDS, AUTOMATA, AND GLOBAL SEMIGROUP THEORY
• On the extension problem for partial permutations
• ALGORITHMIC PROBLEMS IN VARIETIES
• The Word Problem for Abstract Algebras

This page was built for publication: The uniform word problem for groups and finite Rees quotients of \(E\)-unitary inverse semigroups