A kleene theorem for recognizable languages over concurrency monoids (Q4632442): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-58201-0_84 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1582828320 / rank | |||
Normal rank | |||
Revision as of 22:28, 19 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
