2 research outputs found
dP Automata versus Right-Linear Simple Matrix Grammars
We consider dP automata with the input string distributed in an arbitrary
(hence not necessary balanced) way, and we investigate their language accepting power,
both in the case when a bound there is on the number of objects present inside the system
and in the general case. The relation with right-linear simple matrix grammars is useful
in this respect. Some research topics and open problems are also formulated.Junta de Andalucía P08 – TIC 0420
dP Automata versus Right-Linear Simple Matrix Grammars
Summary. We consider dP automata with the input string distributed in an arbitrary (hence not necessary balanced) way, and we investigate their language accepting power, both in the case when a bound there is on the number of objects present inside the system and in the general case. The relation with right-linear simple matrix grammars is useful in this respect. Some research topics and open problems are also formulated.