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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Daley, M., Eramian, M., & McQuillan, I. (2003). Bag automata and stochastic retrieval of biomolecules in solution. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2759, 239–250. https://doi.org/10.1007/3-540-45089-0_22
Mendeley helps you to discover research relevant for your work.