One-Sided Dyck Reduction Over Two Letter Alphabet and Deterministic Context-Free Languages.

Fabienne Romian Jacques Sakarovitch

Published in: MFCS (1986)

Keyphrases

context free languages
context free
context free grammars
grammatical inference
regular languages
finite automata
pattern matching
context dependent
inductive inference
knowledge base
context sensitive
regular expressions
positive data
reinforcement learning
upper bound
finite state