Hardest languages for conjunctive and Boolean grammars.
Alexander OkhotinPublished in: Inf. Comput. (2019)
Keyphrases
- grammatical inference
- mildly context sensitive
- context free grammars
- context free
- context free languages
- grammar induction
- expressive power
- real valued
- finite state automata
- closure properties
- multi lingual
- boolean functions
- cross lingual
- language independent
- formal languages
- positive data
- natural language processing
- syntactic pattern recognition
- language identification
- disjunctive normal form
- machine learning
- closely related
- language processing
- context sensitive