Login / Signup
Context-Free Complexity of Finite Languages.
Walter Bucher
Hermann A. Maurer
Karel Culík II
Published in:
Theor. Comput. Sci. (1984)
Keyphrases
</>
context free
context sensitive
grammatical inference
context dependent
context free languages
context free grammars
closure properties
finite state
inductive inference
finite automata
graph grammars
tree languages
regular languages
parse tree
grammar rules
natural language
information retrieval