On universally easy classes for NP-complete problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Context-free languages of sub-exponential growth
Journal of Computer and System Sciences
Note: on universally easy classes for NP-complete problems
Theoretical Computer Science
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
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 the density of regular and context-free languages
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Groups, graphs, languages, automata, games and second-order monadic logic
European Journal of Combinatorics
| Hi-index | 5.23 |