Name
Abstract | ||
|---|---|---|
Pure two-dimensional context-free grammar P2DCFG is a simple but effective non-isometric 2D grammar model to generate picture arrays. This 2D grammar uses only one kind of symbol as in a pure string grammar and rewrites in parallel all the symbols in a column or row by a set of context-free type rules. P2DCFG and a variant called l﾿/﾿uP2DCFG, which was recently introduced motivated by the \"leftmost\" rewriting mode in string context-free grammars, have been investigated for different properties. In this paper we introduce another variant of P2DCFG that corresponds to \"rightmost\" rewriting in string context-free grammars. The resulting grammar is called r﾿/﾿dP2DCFG and rewrites in parallel all the symbols only in the rightmost column or the lowermost row of a picture array by a set of context-free type rules. Unlike the case of string context-free grammars, the picture language families of P2DCFG and the two variants l﾿/﾿uP2DCFG and r﾿/﾿dP2DCFG are mutually incomparable, although they are not disjoint. We also examine the effect of regulating the rewriting in a r﾿/﾿dP2DCFG by suitably adapting two well-known control mechanisms in string grammars, namely, control words and matrix control. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-26145-4_14 | IWCIA |
Field | DocType | Citations |
Tree-adjoining grammar,Context-sensitive grammar,Discrete mathematics,Combinatorics,Context-free grammar,Computer science,String grammar,Picture language,Ambiguous grammar,Prefix grammar,Mildly context-sensitive grammar formalism | Conference | 1 |
PageRank | References | Authors |
0.36 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| K. G. Subramanian | 1 | 339 | 59.27 |
| M. Geethalakshmi | 2 | 30 | 3.21 |
| N. Gnanamalar David | 3 | 2 | 2.74 |
| Atulya K. Nagar | 4 | 689 | 104.26 |