Free group languages: Rational versus recognizable
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1820023 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 1237771 (Why is no real title available?)
- A Problem on Rational Subsets of the Free Group
- On free inverse monoid languages
- On the rational subsets of the free group
Cited in
(9)- Free groups and regular expressions
- The finite power property in free groups
- Rational series in the free group and the Connes operator
- Finite idempotent inverse monoid presentations.
- INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS
- Infinite periodic points of endomorphisms over special confluent rewriting systems
- scientific article; zbMATH DE number 1820023 (Why is no real title available?)
- Rational subsets of partially reversible monoids
- Context-free languages and random walks on groups
This page was built for publication: Free group languages: Rational versus recognizable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4825388)