Bag automata and stochastic retrieval of biomolecules in solution

Authors:
Mark Daley;Mark Eramian;Ian McQuillan
Affiliations:
Department of Computer Science, University of Saskatchewan, Saskatoon, Saskatchewan, Canada;Department of Computer Science, University of Saskatchewan, Saskatoon, Saskatchewan, Canada;Department of Computer Science, University of Western Ontario, London, Ontario, Canada
Venue:
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Year:
2003

Citing 5
Cited 0

Content-Addressable and Associative Memory: Alternatives to the Ubiquitous RAM

Computer
Algebraic and Automata-Theoretic Properties of Formal Languages

Algebraic and Automata-Theoretic Properties of Formal Languages
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we define the notion of a well-formed bag automaton, which is used to model the inherent problems associated with the retrieval of biomolecules from solution.We will consider the computational power and other properties of non-deterministic and deterministic, well-formed bag automata.