The bag automaton: a model of nondeterministic storage

Authors:
Mark Daley;Mark Eramian;Ian Mcquillan
Affiliations:
Department of Computer Science and Department of Biology, University of Western Ontario, London, Ontario, Canada;Department of Computer Science, University of Saskatchewan, Saskatoon, Saskatchewan, Canada;Department of Computer Science, University of Saskatchewan, Saskatoon, Saskatchewan, Canada
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2008

Citing 5
Cited 0

Algebraic and Automata-Theoretic Properties of Formal Languages

Algebraic and Automata-Theoretic Properties of Formal Languages
Automata, Languages, and Machines

Automata, Languages, and Machines
Multiset Automata

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Decidability of reachability in vector addition systems (Preliminary Version)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we define the notion of a well-formed bag automation, which is used to model the inherent problems associated with the retrieval of elements from nondeterministic storage, such as a bag. The transition applied by such a machine depends on the symbol retrieved by a bag as well as the current input symbol. We will consider the computational power and other properties of nondeterministic and deterministic, well-formed bag automata. Of particular interest is a strict, infinite hierarchy of deterministic well-formed bag languages which we demonstrate between the deterministic counter languages and the deterministic context-free languages.