Login / Signup
Characterizing the Class of Deterministic Context-Free Languages by Semi-Right-Terminating Uniquely Parsable Grammars.
Kenichi Morita
Jia Lee
Published in:
Recent Topics in Mathematical and Computational Linguistics (2000)
Keyphrases
</>
context free languages
context free
regular languages
context free grammars
grammatical inference
positive data
context sensitive
inductive inference
finite automata
regular expressions
decision problems
context dependent
finite state
training data
np hard
information extraction
computational complexity