2 research outputs found
When Stars Control a Grammar's Work
Graph-controlled insertion-deletion (GCID) systems are regulated extensions
of insertion-deletion systems. Such a system has several components and each
component contains some insertion-deletion rules. The components are the
vertices of a directed control graph. A rule is applied to a string in a
component and the resultant string is moved to the target component specified
in the rule. The language of the system is the set of all terminal strings
collected in the final component. We impose the restriction in the structure of
the underlying graph to be a star structure where there is a central, control
component which acts like a master and transmits a string (after applying one
of its rules) to one of the components specified in the (applied) rule. A
component which receives the string can process the obtained string with any
applicable rule available in it and sends back the resultant string only to the
center component. With this restriction, we obtain computational completeness
for some descriptional complexity measuresComment: In Proceedings AFL 2023, arXiv:2309.0112
About One-Sided One-Symbol Insertion-Deletion P Systems
International audienceno abstrac