Inverse automata and inverse monoid: Schützenberger-graphs of a semilattice with identity.

MaRDI QIDQ3366893zbMATH OpenFDO

Authors Yongwen Zhu

Publication date 16 February 2006

zbMATH Keywords

automataCayley graphsinverse monoidspresentationsSchützenberger graphs

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Inverse semigroups (20M18) Semigroups in automata theory, linguistics, etc. (20M35) Algebraic theory of languages and automata (68Q70)

Recommendations

• Inverse automata and monoids and the undecidability of the cayley subgraph problem for groups
• Algorithmic properties of inverse monoids with hyperbolic and tree-like Schützenberger graphs
• Trees associated to inverse monoid presentations
• Inverse monoids of partial graph automorphisms
• Presentations of inverse monoids

Cited in

(4)

• Inverse monoids and bounded distributive lattices
• Inverse monoids of higher-dimensional strings
• Classification of inverse semigroups generated by two-state partially defined invertible automata over the two-symbol alphabet.
• Trees associated to inverse monoid presentations

This page was built for publication: Inverse automata and inverse monoid: Schützenberger-graphs of a semilattice with identity.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3366893)