Advertisement

Bag Automata and Stochastic Retrieval of Biomolecules in Solution

  • Mark Daley
  • Mark Eramian
  • Ian McQuillan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2759)

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.

Keywords

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    B. Baker, R. Book, Reversal-bounded multipushdown machines. Journal of Computer System Sciences8 (1974), 315–332.zbMATHMathSciNetGoogle Scholar
  2. [2]
    L. Chisvin, R. J. Duckworth, Content-addressable and associative memory. Computer22(7) (1989), 51–64.CrossRefGoogle Scholar
  3. [3]
    E. Csuhaj-Varju, C. Martin-Vide and V. Mitrana, Multiset automata. Lecture Notes in Computer Science2235. Springer, Berlin (2001), 69–83.Google Scholar
  4. [4]
    S. Ginsburg, Algebraic and automata-theoretic properties of formal languages. North-Holland Publishing Company, Amsterdam 1975.zbMATHGoogle Scholar
  5. [5]
    S. Greibach, Remarks on blind and partially blind one-way multicounter machines. Theoretical Computer Science7 (1978), 311–324.zbMATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    J. Hopcroft, J. Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 1979.zbMATHGoogle Scholar
  7. [7]
    S. R. Kosaraju, Decidability of reachability in vector addition systems. Proc. 14th Symp. Theory of Comput. (1982), 267–281.Google Scholar
  8. [8]
    L. Valiant, Deterministic one-counter automata. Journal of Computer and System Sciences10 (1975), 340–350.zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Mark Daley
    • 1
  • Mark Eramian
    • 1
  • Ian McQuillan
    • 2
  1. 1.Department of Computer ScienceUniversity of SaskatchewanSaskatoonCanada
  2. 2.Department of Computer ScienceUniversity of Western OntarioLondonCanada

Personalised recommendations