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

Irredundancy in circular arc graphs

Martin Charles Golumbic, Renu C. Laskar

Discrete Applied Mathematics

Conference paper

Compression for data archiving and backup revisited

Corneliu Constantinescu

SPIE Optical Engineering + Applications 2009

Conference paper

Modeling UpLink power control with outage probabilities

Kenneth L. Clarkson, K. Georg Hampel, et al.

VTC Spring 2007

Paper

Multi-dimensional Filter Banks and Wavelets - A System Theoretic Perspective

Sankar Basu

Journal of the Franklin Institute

View all publications