PaperCharacterizing derivation trees of context-free grammars through a generalization of finite automata theory