Inverse monoids of higher-dimensional strings

DOI10.1007/978-3-319-25150-9_9MaRDI QIDQ2787420zbMATH OpenOpenAlexFDO

Authors David Janin

Publication date 25 February 2016

Published in Theoretical Aspects of Computing - ICTAC 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-25150-9_9

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Inverse semigroups (20M18) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Inverse Monoids, Trees, and Context-Free Languages
• Inverse automata and inverse monoid: Schützenberger-graphs of a semilattice with identity.
• Presentations of inverse monoids
• FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
• On graph inverse semigroups

Cited in

(6)

• About applications of distances on monoids of strings
• On monotone clones of strings
• Towards a higher-dimensional string theory for the modeling of computerized systems
• Units of the string link monoids
• Bideterministic weighted automata
• The set of strings mapped into a submonoid by iterates of a morphism

This page was built for publication: Inverse monoids of higher-dimensional strings

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