On recognizable subsets of free partially commutative monoids (Q1111703): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(88)90027-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1576513528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inhomogeneous sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems of commutation and rearrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3736919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizable subsets of some partially Abelian monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal serializability of iterated transactions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5536277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3754627 / rank
 
Normal rank

Latest revision as of 10:52, 19 June 2024

scientific article
Language Label Description Also known as
English
On recognizable subsets of free partially commutative monoids
scientific article

    Statements

    On recognizable subsets of free partially commutative monoids (English)
    0 references
    1988
    0 references
    0 references
    free partially abelian monoid
    0 references
    finite alphabet
    0 references
    words
    0 references
    recognizable
    0 references
    0 references
    0 references