Author:
D'Alessandro Flavio,Intrigila Benedetto
Subject
General Computer Science,Theoretical Computer Science
Reference12 articles.
1. Codes and Automata;Berstel,2009
2. On the structure of the counting function of context-free languages;D'Alessandro;Theoret. Comput. Sci.,2006
3. The Parikh counting functions of sparse context-free languages are quasi-polynomials;D'Alessandro;Theoret. Comput. Sci.,2009
4. The commutative equivalence of bounded context-free and regular languages;D'Alessandro,2011
5. Quasi-polynomials, semi-linear set, and linear diophantine equations;D'Alessandro;Theoret. Comput. Sci.,2012
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献