A kleene theorem for recognizable languages over concurrency monoids (Q4632442): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:25, 7 February 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
