Intersection of two monoids generated by two element codes (Q7361377)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Two_Generated_Word_Monoids_Intersection
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Intersection of two monoids generated by two element codes |
AFP entry Two_Generated_Word_Monoids_Intersection |
Statements
3 January 2023
0 references
Štěpán Holub
0 references
Štěpán Starosta
0 references
Intersection of two monoids generated by two element codes (English)
0 references
This article provides a formalization of the classification of intersection \( \{x,y\}^* \cap \{u,v\}^*\) of two monoids generated by two element codes. Namely, the intersection has one of the following forms \( \{\beta,\gamma\}^* \quad \text{ or } \quad \left(\beta_0 + \beta(\gamma(1+\delta+ \cdots + \delta^t))^*\epsilon\right)^*.\) 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.
0 references