Multiset Automata

  • Authors:
  • Erzsébet Csuhaj-Varjú;Carlos Martin-Vide;Victor Mitrana

  • Affiliations:
  • -;-;-

  • Venue:
  • WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

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.