A kleene theorem for recognizable languages over concurrency monoids (Q4632442): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 16:41, 5 March 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
