Abstract
This article provides a formalization of the classification of intersection
of two monoids generated by two element codes.
Namely, the intersection has one of the following forms
Note that it can be infinitely generated.
The result is due to [Karhumäki, 84]. Our proof uses the terminology of morphisms which allows us to formulate the result in a shorter and more transparent way.
License
History
- August 17, 2023
- Updated to version v1.10.1.
Topics
Related publications
- Karhumäki, J. (n.d.). A note on intersections of free submonoids of a free monoid. Automata, Languages and Programming, 397–407. https://doi.org/10.1007/bfb0036924
- Development repository