On the structure of the counting function of sparse context-free languages
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Slender Siromoney matrix languages
Information and Computation
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
The Parikh counting functions of sparse context-free languages are quasi-polynomials
Theoretical Computer Science
On the growth of context-free languages
Journal of Automata, Languages and Combinatorics
On a Hierarchy of Slender Languages Based on Control Sets
Fundamenta Informaticae
| Hi-index | 0.00 |