Multiset automata

Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Victor Mitrana

Research output: Chapter in Book/Report/Conference proceedingChapter

41 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationMultiset Processing
Subtitle of host publicationMathematical, Computer Science, and Molecular Computing Points of View
PublisherSpringer Verlag
Pages69-83
Number of pages15
ISBN (Print)3540430636, 9783540430636
Publication statusPublished - Jan 1 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2235
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Multiset automata'. Together they form a unique fingerprint.

  • Cite this

    Csuhaj-Varjú, E., Martín-Vide, C., & Mitrana, V. (2001). Multiset automata. In Multiset Processing: Mathematical, Computer Science, and Molecular Computing Points of View (pp. 69-83). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2235). Springer Verlag.