Login / Signup
The Computational Complexity of the Universal Recognition Problem for Parallel Multiple Context-Free Grammars.
Yuichi Kaji
Ryuchi Nakanishi
Hiroyuki Seki
Tadao Kasami
Published in:
Comput. Intell. (1994)
Keyphrases
</>
context free grammars
computational complexity
grammatical inference
context free languages
attribute grammars
syntactic pattern recognition
neural network
machine learning
artificial intelligence
data model
natural language processing
np complete
pattern matching
context free