Context-Free Valence Grammars - Revisited

Context-free valence languages (over Zk ) are shown to be codings of the intersection of a context-free language and a blind kcounter language. This afl-style characterization allows one to infer some of the properties of the family of valence languages, in particular the -free normal form proved by Fernau and Stiebe.

• Type: Conference
• Year: 2001
• Where: DLT
• Authors: Hendrik Jan Hoogeboom
• Keywords: Blind Kcounter Language, Context-free Language, Context-free Valence Languages, DLT 2001, DLT 2007