论文信息 - Context-Free Valence Grammars - Revisited

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 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.

Hendrik Jan Hoogeboom

[1] Hendrik Jan Hoogeboom,et al. Upper Bounds for Restricted Splicing , 2002, Formal and Natural Computing.

[2] Gheorghe Paun,et al. Regulated Rewriting in Formal Language Theory , 1989 .

[3] Arto Salomaa,et al. Formal languages , 1973, Computer science classics.

[4] Michel Latteux,et al. Cônes rationnels commutatifs , 1979, J. Comput. Syst. Sci..

[5] Sheila A. Greibach. Remarks on Blind and Partially Blind One-Way Multicounter Machines , 1978, Theor. Comput. Sci..

[6] Gheorghe Paun,et al. The Power of Restricted Splicing with Rules from a Regular Language , 1996, J. Univers. Comput. Sci..

[7] Seymour Ginsburg,et al. Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .

[8] Henning Fernau,et al. Regulations by Valences , 1997, MFCS.

[9] Hendrik Jan Hoogeboom,et al. Fair sticker languages , 2000, Acta Informatica.

[10] Henning Fernau,et al. Sequential grammars and automata with valences , 2002, Theor. Comput. Sci..

[11] Gheorghe Paun,et al. Language Theory and Molecular Genetics: Generative Mechanisms Suggested by DNA Recombination , 1997, Handbook of Formal Languages.