Journal of Computer and System Sciences

Paper

01 Dec 1967

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

View publication

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

Paper

Dynamically Meaningful Latent Representations of Dynamical Systems

Imran Nasim, Michael E. Henderson

Mathematics

Paper

Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems *

Y.Y. Li, K.S. Leung, et al.

J Combin Optim

Conference paper

Wavefront and caustic surfaces of refractive laser beam shaper

David L. Shealy, John A. Hoffnagle

SPIE Optical Engineering + Applications 2007

Paper

On the spectral radius of (0,1)-matrices

R.A. Brualdi, A.J. Hoffman

Linear Algebra and Its Applications

View all publications