Recognizable languages in concurrency monoids (Q672317): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q126321978, #quickstatements; #temporary_batch_1719269348057
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Theory of traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3766854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal and Optimal Computations of Recursive Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From domains to automata with concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelled domains and automata with concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525343 / 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: Q3736919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics on traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCURRENT AUTOMATA AND DOMAINS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kleene theorem for recognizable languages over concurrency monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aperiodic languages in concurrency monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-free trace languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining conditional independence using collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922646 / 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: Q3795195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the definition of a family of automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connections between a concrete and an abstract model of concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositional relational semantics for indeterminate dataflow networks / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126321978 / rank
 
Normal rank

Latest revision as of 23:50, 24 June 2024

scientific article
Language Label Description Also known as
English
Recognizable languages in concurrency monoids
scientific article

    Statements

    Recognizable languages in concurrency monoids (English)
    0 references
    0 references
    28 February 1997
    0 references
    automata
    0 references
    transition systems
    0 references

    Identifiers