Inverse automata and monoids and the undecidability of the cayley subgraph problem for groups

DOI10.1017/S001708950003010XzbMath0986.20063OpenAlexW2019682114MaRDI QIDQ4522275

No author found.

Publication date: 24 February 2002

Published in: Glasgow Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s001708950003010x

zbMATH Keywords

undecidabilityautomataCayley graphsinverse monoidsinverse monoid presentationsSchützenberger graphs

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Inverse semigroups (20M18)

Related Items (3)

The uniform word problem for groups and finite Rees quotients of \(E\)-unitary inverse semigroups ⋮ Trees associated to inverse monoid presentations ⋮ Cayley graphs as classifiers for data mining: the influence of asymmetries

This page was built for publication: Inverse automata and monoids and the undecidability of the cayley subgraph problem for groups