Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Paper
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
Abstract
The recognizable sets of value trees (pseudoterms) are shown to be exactly projections of sets of derivation trees of (extended) context-free grammars. © 1968 Academic Press Inc.
Related
Conference paper
Byzantine-Robust Decentralized Federated Learning
Minghong Fang, Zifan Zhang, et al.
CCS 2024
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis