论文信息 - Generative Capacity of Subregularly Tree Controlled Grammars

Generative Capacity of Subregularly Tree Controlled Grammars

Tree controlled grammars are context-free grammars where the associated language only contains those terminal words which have a derivation where the word of any level of the corresponding derivation tree belongs to a given regular language. We present some results on the power of such grammars where we restrict the regular languages to some known subclasses of the family of regular languages.

Bianca Truthe | Jürgen Dassow | Ralf Stiebe

[1] Bianca Truthe,et al. Subregularly Tree Controlled Grammars and Languages , 2008, AFL.

[2] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .

[3] Grzegorz Rozenberg,et al. Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[4] Ivan M. Havel,et al. The theory of regular events. II , 1969, Kybernetika.

[5] Hermann A. Maurer,et al. Tree controlled grammars , 2005, Computing.

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

[7] Gheorghe Paun. On the generative capacity of tree controlled grammars , 2005, Computing.