On the Computational Complexity of Synchronized Context-Free Languages.

Henning Bordihn Markus Holzer

Published in: J. Univers. Comput. Sci. (2002)

Keyphrases

context free languages
computational complexity
context free
grammatical inference
context free grammars
regular languages
decision problems
special case
inductive inference
np hard
context sensitive
regular expressions
database
production rules
positive data
finite state
learning algorithm