Login / Signup
The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages.
Alberto Bertoni
Massimiliano Goldwurm
Nicoletta Sabadini
Published in:
Theor. Comput. Sci. (1991)
Keyphrases
</>
context free languages
computational complexity
context free grammars
context free
matching algorithm
decision problems
grammatical inference
alphabet size