Abstract

A context-free grammar (CFG) in Greibach Normal Form coincides, in another
notation, with a system of guarded recursion equations in Basic Process algebra. Hence, to each
CFG, aprocess can be assigned absolution, which has as its set of finite traces the context-free
language (CFL)determined by that CFG. Although the equality problem for CFLs
... read more