Abstract
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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Pǎun, G., & Pérez-Jiménez, M. J. (2012). DP automata versus right-linear simple matrix grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7160 LNCS, pp. 376–387). https://doi.org/10.1007/978-3-642-27654-5_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
