The Parikh counting functions of sparse context-free languages are quasi-polynomials (Q1034637)
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 5626982
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Parikh counting functions of sparse context-free languages are quasi-polynomials |
scientific article; zbMATH DE number 5626982 |
Statements
The Parikh counting functions of sparse context-free languages are quasi-polynomials (English)
0 references
6 November 2009
0 references
sparse language
0 references
context-free language
0 references
semi-linear set
0 references
Parikh counting function
0 references
0.8835033178329468
0 references
0.7826597690582275
0 references
0.7581583261489868
0 references
0.7572230100631714
0 references
