Weak bisimilarity and regularity of context-free processes is EXPTIME-hard.

Published in: Theor. Comput. Sci. (2005)

Keyphrases

context free
tree automata
context dependent
context sensitive
grammatical inference
context free grammars
attribute grammars
finite state
inductive inference
graph grammars
computational models
decision problems
first order logic
pattern matching
knowledge based systems
text classification
relational databases