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.
Input Word Pushdown Automaton Counter Automaton Blank Symbol Lambda Transition
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.