Abstract
We propose a characterization of a Chomsky-like hierarchy of multiset grammars in terms of multiset automata. We also present the deterministic variants of all the automata investigated and prove that, unlike the string case, most of them are strictly less powerful than the nondeterministic variants. Some open problems and further directions of research are briefly discussed. © 2001 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Csuhaj-Varjú, E., Martín-Vide, C., & Mitrana, V. (2001). Multiset automata. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2235, 69–83. https://doi.org/10.1007/3-540-45523-x_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
