Language classes generated by tree controlled grammars with bounded nonterminal complexity.
Sherzod TuraevJürgen DassowFlorin ManeaMohd Hasan SelamatPublished in: Theor. Comput. Sci. (2012)
Keyphrases
- context free languages
- natural language
- visual languages
- regular languages
- grammatical inference
- tree structure
- tractable cases
- tree languages
- programming language
- mildly context sensitive
- tree grammars
- complexity measures
- classification trees
- context free
- context free grammars
- decision problems
- worst case
- automatically generated
- space complexity
- positive data
- database systems
- bounded treewidth
- formal language
- phrase structure
- algebraic operations
- tree structures
- computational complexity
- closure properties
- language learning
- bounded degree
- language processing
- machine translation
- index structure