Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma-p-2-Complete.
Dung T. HuynhPublished in: Theor. Comput. Sci. (1984)
Keyphrases
- context free grammars
- grammatical inference
- context free languages
- context free
- pattern matching
- finite automata
- syntactic pattern recognition
- regular expressions
- grammar induction
- neural network
- closure properties
- attribute grammars
- production rules
- knowledge based systems
- tree automata
- regular languages
- formal languages
- lexical semantics
- natural language processing
- artificial intelligence
- databases
- covering arrays