It is shown that regular control on regular and linear kolam array grammars does not increase their generative capacity, while CF and CS controls increase their generative capacity
AbstractThis paper establishes a workspace theorem in terms of regular-controlled (context-free) gra...
International audienceWe introduce new possibilities to control the application of rules based on th...
In this paper,we define Watson-Crick linear grammars extending Watson-Crick regular grammars Subrama...
It is shown that regular control on regular and linear kolam array grammars does not increase their ...
International audienceWe investigate the computational power of d-dimensional contextual array gramm...
A generative two-dimensional rectangular array model which allows for growth along the edges is prop...
International audienceWe extend and refine previous results within the general framework for regulat...
The effects of 1) regular control, 2) appearance checking, and 3) minimal table interpretation on e...
A conditional grammar is a Chomsky grammar with languages associated to its rules such that each rul...
For a context-free grammar form G, the result of the G-control operator acting on a family of langua...
Generative models of picture languages with array rewriting rules are presented. The rewriting rules...
Tree Adjunct Kolam Array Grammars (TAKAG) are proposed to generate rectangular arrays of terminal sy...
For context-free grammars, all of the following restrictive devices are equivalent with respect to g...
Control sets on linear grammars are used to define a generalization of the metalinear hierarchy with...
The generative capacity of the compound grammars is investigated. We shall prove that the compositio...
AbstractThis paper establishes a workspace theorem in terms of regular-controlled (context-free) gra...
International audienceWe introduce new possibilities to control the application of rules based on th...
In this paper,we define Watson-Crick linear grammars extending Watson-Crick regular grammars Subrama...
It is shown that regular control on regular and linear kolam array grammars does not increase their ...
International audienceWe investigate the computational power of d-dimensional contextual array gramm...
A generative two-dimensional rectangular array model which allows for growth along the edges is prop...
International audienceWe extend and refine previous results within the general framework for regulat...
The effects of 1) regular control, 2) appearance checking, and 3) minimal table interpretation on e...
A conditional grammar is a Chomsky grammar with languages associated to its rules such that each rul...
For a context-free grammar form G, the result of the G-control operator acting on a family of langua...
Generative models of picture languages with array rewriting rules are presented. The rewriting rules...
Tree Adjunct Kolam Array Grammars (TAKAG) are proposed to generate rectangular arrays of terminal sy...
For context-free grammars, all of the following restrictive devices are equivalent with respect to g...
Control sets on linear grammars are used to define a generalization of the metalinear hierarchy with...
The generative capacity of the compound grammars is investigated. We shall prove that the compositio...
AbstractThis paper establishes a workspace theorem in terms of regular-controlled (context-free) gra...
International audienceWe introduce new possibilities to control the application of rules based on th...
In this paper,we define Watson-Crick linear grammars extending Watson-Crick regular grammars Subrama...
DOI
Add to ORKG