An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid (Q3526414): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2124266008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The meet operation in the lattice of codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsing with a finite dictionary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Intersection of Finitely Generated Free Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on intersections of free submonoids of a free monoid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3674079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgroups of free groups: a contribution to the Hanna Neumann conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3231202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3209315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection of free submonoids of a free monoid is free / rank
 
Normal rank

Latest revision as of 16:42, 28 June 2024

scientific article
Language Label Description Also known as
English
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
scientific article

    Statements

    An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid (English)
    0 references
    0 references
    0 references
    25 September 2008
    0 references
    product automata
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references