Login / Signup
Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages.
Alexander Meduna
Published in:
Int. J. Comput. Math. (1997)
Keyphrases
</>
mildly context sensitive
grammatical inference
recursively enumerable
inductive inference
context free grammars
recursive functions
context free
special case
pattern recognition
data streams
domain knowledge
upper bound
information extraction
natural language processing