Trees associated to inverse monoid presentations

DOI10.1016/S0022-4049(00)00190-0zbMath0999.20051OpenAlexW2058955078MaRDI QIDQ5956884

Pedro V. Silva

Publication date: 11 September 2002

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-4049(00)00190-0

zbMATH Keywords

automatainverse monoidsdecidabilityinverse monoid presentationslanguagesrational treesSchützenberger graphs

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Free semigroups, generators and relations, word problems (20M05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Semigroups in automata theory, linguistics, etc. (20M35) Inverse semigroups (20M18)

Related Items (1)

FINITE IDEMPOTENT INVERSE MONOID PRESENTATIONS

Cites Work

• Presentations of inverse monoids
• Inverse monoids and rational Schreier subsets of the free group
• The word problem of inverse monoids presented by one idempotent relator
• Inverse Monoids, Trees, and Context-Free Languages
• RATIONAL LANGUAGES AND INVERSE MONOID PRESENTATIONS
• Free Inverse Semigroups
• Characterizations of Schützenberger graphs in terms of their automorphism groups and fundamental groups
• CONJUGACY AND TRANSPOSITION FOR INVERSE MONOID PRESENTATIONS
• Inverse automata and monoids and the undecidability of the cayley subgraph problem for groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Trees associated to inverse monoid presentations