2-asynchronous automata (Q1109571): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Semi-commutations / 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: Q3725561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on finite asynchronous automata / rank
 
Normal rank

Latest revision as of 19:11, 18 June 2024

scientific article
Language Label Description Also known as
English
2-asynchronous automata
scientific article

    Statements

    2-asynchronous automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1988
    0 references
    0 references
    finite automata
    0 references
    asynchronous automata
    0 references
    concurrent processes
    0 references
    0 references