Descriptional complexity of bounded context-free languages (Q383365)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Descriptional complexity of bounded context-free languages |
scientific article; zbMATH DE number 6235544
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Descriptional complexity of bounded context-free languages |
scientific article; zbMATH DE number 6235544 |
Statements
Descriptional complexity of bounded context-free languages (English)
0 references
4 December 2013
0 references
automata
0 references
formal languages
0 references
descriptional complexity
0 references
finite-turn pushdown automata
0 references
recursive trade-offs
0 references
bounded languages
0 references
0.991421401500702
0 references
0.8271472454071045
0 references
0.8270379900932312
0 references
0.8270111083984375
0 references
