Basic Puzzle Languages

Abstract

The emptiness problem for non-overlapping Basic puzzle grammars is shown to be decidable. An alternate proof of the decidability of the non-overlapping feature for basic puzzle grammars is given. Hierarchy among the various classes of puzzle languages is also established.

On Special forms of Splicing on Arrays and Graphs

“…On the other hand, in syntactic approaches to generation and recognition of picture patterns, considered as arrays of symbols, several twodimensional grammars have been proposed and studied [ 5,12,15,16,17,18,19,20] extending and generalizing the techniques of formal string language theory. Splicing of arrays structures which could be thought of as graphs on grid structures has also been recently considered [2,10].…”

Iso-array rewriting P systems with context-free iso-array rules

“…Ceterchi et al began a study on linking the two areas of membrane computing and picture grammars by relating P systems and array rewriting grammars generating picture languages and proposing array rewriting P systems [2]. Subsequently, a number of P systems with array objects and different kinds of rewriting were introduced in [5,10,11]. The two dimensional grammar models called puzzle grammars for generating connected arrays of unit cells are discussed in [12,13].…”

Modelo de computación conexionista inspirado en las redes de procesadores evolutivos y su aprendizaje

“…Modelos arrays y matrices de dos dimensiones de los Pictures mencionados han sido propuestos como arrays rectangulares de símbolos en [101,94,91,90]. También estos modelos de definición de Pictures han sido tratados como Arrays no necesariamente rectangulares en los años 70 [88] y una jerarquía de estas gramáticas fue expuesta en [100,95]. Otro tipo de clases de gramáticas para la generación de Picture , no necesariamente rectangulares fue definida en [73].…”