A note on intersections of free submonoids of a free monoid (Q760507): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Sur le théorème du defaut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata that recognize intersections of free submonoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On binary equality sets and a solution to the test set conjecture in the binary case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection of free submonoids of a free monoid is free / rank
 
Normal rank

Revision as of 15:32, 14 June 2024

scientific article
Language Label Description Also known as
English
A note on intersections of free submonoids of a free monoid
scientific article

    Statements

    A note on intersections of free submonoids of a free monoid (English)
    0 references
    0 references
    1984
    0 references
    Let S be a finite alphabet. The free monoid generated by S is denoted by \(S^*\). Let \(X=\{x,y\}\) for some \(x,y\in S^*\). X is periodic if \(X\subseteq p^*\) for some \(p\in S^*\). The main result of the paper says: Let \(X=\{x,y\}\) and \(U=\{u,v\}\) be nonperiodic subsets of \(S^*\). Then \(\{x,y\}^*\cap \{u,v\}^*\) has one of the following two forms: i) \(\{b,g\}^*\) for some (possibly empty) words b and g in \(S^*\), ii) \(b_ 0+b(g(1+d+...+d^ t))^*e)^*\) for some (possibly empty) words \(b_ 0\), b, g, and e in \(S^*\), and some integer \(t\geq 0\).
    0 references
    intersection of free monoids
    0 references
    regular languages
    0 references
    finite alphabet
    0 references

    Identifiers