Parikh's theorem and descriptional complexity (Q2891382)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6046542
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parikh's theorem and descriptional complexity |
scientific article; zbMATH DE number 6046542 |
Statements
Parikh’s Theorem and Descriptional Complexity (English)
0 references
15 June 2012
0 references
finite automata
0 references
formal languages
0 references
context-free languages
0 references
descriptional complexity
0 references
Parikh's theorem
0 references
bounded languages
0 references
0 references
0.8638184070587158
0 references
0.8472238779067993
0 references
0.8398094177246094
0 references
0.8158922791481018
0 references
0.7953831553459167
0 references
