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 a process can be
assigned as solution, which has as its set of finite traces the context-free language (CFL) determined by that
CFG. While the equality
... read more