Unambiguous conjunctive grammars over a one-symbol alphabet.
Artur JezAlexander OkhotinPublished in: Theor. Comput. Sci. (2017)
Keyphrases
- grammatical inference
- natural language
- pattern matching
- finite automata
- context free grammars
- natural language processing
- tree grammars
- context free
- syntactic pattern recognition
- context sensitive
- finite state automata
- symbol recognition
- inductive logic programming systems
- visual languages
- context free languages
- parse selection
- inductive inference
- data sets
- closely related
- multiscale
- knowledge base
- artificial intelligence
- machine learning
- real world
- neural network