Add to ORKGHere we introduce a variant of extended two-dimensional context-free picture grammar (E2DCF P G), called (l/u)E2DCF P G which allows rewriting only the leftmost column, or the uppermost row of variables in a picture array. Several theoretical properties of (l/u)E2DCF P G are obtained and an application in generating digitized picture arrays is discussed
Two formal models of pictures, i.e., two dimensional (2D) languages are compared: tiling systems and...
AbstractTwo formal models of pictures, i.e., two dimensional (2D) languages are compared: tiling sys...
Picture languages generalize classical string languages to two-dimensional arrays. Several approache...
Here we introduce a variant of extended two-dimensional context-free picture grammar (E2DCF P G), ca...
A new syntactic model, called pure two-dimensional (2D) context-free grammar (P2DCFG), is introduced...
AbstractA new syntactic model, called pure two-dimensional (2D) context-free grammar (P2DCFG), is in...
AbstractSeveral old and recent classes of picture grammars, that variously extend context-free strin...
Generative models of picture languages with array rewriting rules are presented. The rewriting rules...
Pure 2D context-free grammar (P2DCFG) with an independent mode of array rewriting, was recently intr...
Theoretical syntactic models for generation, recognition and analysis of non-linear structures such ...
Recently, a novel model, called Tile Rewriting Grammar (TRG), has been introduced to apply the gener...
Several old and recent classes of picture grammars, that variously extend context-free string gramm...
Tile Rewriting Grammars (TRG) are a new model for defining picture languages. A rewriting rule chan...
AbstractTile rewriting grammars (TRG) are a new model for defining picture languages. A rewriting ru...
Two formal models of pictures, i.e., two dimensional (2D) languages are compared: tiling systems and...
AbstractTwo formal models of pictures, i.e., two dimensional (2D) languages are compared: tiling sys...
Picture languages generalize classical string languages to two-dimensional arrays. Several approache...
Here we introduce a variant of extended two-dimensional context-free picture grammar (E2DCF P G), ca...
A new syntactic model, called pure two-dimensional (2D) context-free grammar (P2DCFG), is introduced...
AbstractA new syntactic model, called pure two-dimensional (2D) context-free grammar (P2DCFG), is in...
AbstractSeveral old and recent classes of picture grammars, that variously extend context-free strin...
Generative models of picture languages with array rewriting rules are presented. The rewriting rules...
Pure 2D context-free grammar (P2DCFG) with an independent mode of array rewriting, was recently intr...
Theoretical syntactic models for generation, recognition and analysis of non-linear structures such ...
Recently, a novel model, called Tile Rewriting Grammar (TRG), has been introduced to apply the gener...
Several old and recent classes of picture grammars, that variously extend context-free string gramm...
Tile Rewriting Grammars (TRG) are a new model for defining picture languages. A rewriting rule chan...
AbstractTile rewriting grammars (TRG) are a new model for defining picture languages. A rewriting ru...
Two formal models of pictures, i.e., two dimensional (2D) languages are compared: tiling systems and...
AbstractTwo formal models of pictures, i.e., two dimensional (2D) languages are compared: tiling sys...
Picture languages generalize classical string languages to two-dimensional arrays. Several approache...