A kleene theorem for recognizable languages over concurrency monoids (Q4632442): Difference between revisions

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

Latest revision as of 01:53, 19 July 2024

scientific article; zbMATH DE number 7048690
Language Label Description Also known as
English
A kleene theorem for recognizable languages over concurrency monoids
scientific article; zbMATH DE number 7048690

    Statements

    A kleene theorem for recognizable languages over concurrency monoids (English)
    0 references
    29 April 2019
    0 references
    finite automaton
    0 references
    computation sequence
    0 references
    trace theory
    0 references
    finite word
    0 references
    0 references

    Identifiers