Universal insertion grammars of size two
In this paper, we show that pure insertion grammars of size 2 (ie, inserting two symbols in a
left and right context, each consisting of two symbols) can characterize all recursively …
left and right context, each consisting of two symbols) can characterize all recursively …
Complexity and modeling power of insertion-deletion systems
A Krassovitskiy - 2011 - tdx.cat
COMPLEXITY AND MODELING POWER OF INSERTION-DELETION SYSTEMS The central
object of the thesis are insertion-deletion systems and their computational power. More …
object of the thesis are insertion-deletion systems and their computational power. More …
Rewriting P systems with flat-splicing rules
Rewriting P systems, as language generating devices, are one of the earliest classes of P
systems with structured strings as objects and the rewriting rules as evolution rules. Flat …
systems with structured strings as objects and the rewriting rules as evolution rules. Flat …
Morphic characterizations with insertion systems controlled by a context of length one
K Fujioka - Theoretical Computer Science, 2013 - Elsevier
Among the variety of representation theorems for context-free languages, the Chomsky–
Schützenberger theorem is unique in that it consists of Dyck languages, regular languages …
Schützenberger theorem is unique in that it consists of Dyck languages, regular languages …