Context-Free Valence Grammars - Revisited

Authors:
Hendrik Jan Hoogeboom
Affiliations:
-
Venue:
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Year:
2001

Citing 1
Cited 3

Language theory and molecular genetics: generative mechanisms suggested by DNA recombination

Handbook of formal languages, vol. 2

Sequential grammars and automata with valances

Theoretical Computer Science
Weighted grammars and automata with threshold interpretation

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Valence languages generated by equality sets

Journal of Automata, Languages and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Context-free valence languages (over Zk) are shown to be codings of the intersection of a context-free language and a blind k-counter 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.