A kleene theorem for recognizable languages over concurrency monoids (Q4632442)

From MaRDI portal
Revision as of 22:16, 1 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    29 April 2019
    0 references
    0 references
    finite automaton
    0 references
    computation sequence
    0 references
    trace theory
    0 references
    finite word
    0 references