On free inverse monoid languages
From MaRDI portal
Publication:3124403
DOI10.1051/ITA/1996300403491zbMATH Open0867.68074OpenAlexW133836307MaRDI QIDQ3124403FDOQ3124403
Publication date: 7 August 1997
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92541
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Free products of inverse semigroups II
- Free Inverse Semigroups
- Presentations of inverse monoids
- FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
- E-unitary inverse monoids and the Cayley graph of a group presentation
- Inverse Monoids, Trees, and Context-Free Languages
- RATIONAL LANGUAGES AND INVERSE MONOID PRESENTATIONS
- Inverse monoids and rational Schreier subsets of the free group
- Title not available (Why is that?)
Cited In (10)
- On locally reversible languages
- Free group languages: Rational versus recognizable
- RATIONAL LANGUAGES AND INVERSE MONOID PRESENTATIONS
- Title not available (Why is that?)
- Inverse monoids: decidability and complexity of algebraic questions.
- A lower bound for reversible automata
- ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS
- A syntactic congruence for languages of birooted trees
- On the rational subsets of the monogenic free inverse monoid
- On labeled birooted tree languages: algebras, automata and logic
This page was built for publication: On free inverse monoid languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3124403)
