Two infinite hierarchies of languages defined by branching grammars.
Gheorghe Pǎun · Czech digital mathematics library · 1978
Two types of branching grammars are introduced inspired from Havel's works about branching automata.They naturally define two infinite hierarchies into the family of regular, respectively, linear languages.Homomorphic characterisations of regular and linear languages >n terms of branching languages are obtained.Finally, the relations between branching grammars and contextual grammars of [5] are investigated.