Login / Signup

The Parikh counting functions of sparse context-free languages are quasi-polynomials.

Flavio D'AlessandroBenedetto IntrigilaStefano Varricchio
Published in: Theor. Comput. Sci. (2009)
Keyphrases
  • context free languages
  • grammatical inference
  • context free grammars
  • regular languages
  • context free
  • finite automata
  • learning algorithm
  • knowledge base
  • high dimensional
  • data model
  • dynamic programming