Lower bounds for the state complexity of probabilistic languages and the language of prime numbers.
Nathanaël FijalkowPublished in: J. Log. Comput. (2020)
Keyphrases
- lower bound
- description languages
- native language
- probabilistic model
- programming language
- formal language
- worst case
- pattern languages
- computer programs
- language independent
- english text
- generative model
- upper bound
- expressive power
- regular languages
- objective function
- finite state machines
- declarative language
- linguistic resources
- branch and bound
- object oriented programming
- language processing
- language learning
- decision problems
- state space
- data model
- computational complexity
- natural language