IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v22y2020i1d10.1007_s11009-019-09706-8.html
   My bibliography  Save this article

Stochastic Analysis of Minimal Automata Growth for Generalized Strings

Author

Listed:
  • Ian G. Char

    (University of Colorado)

  • Manuel E. Lladser

    (University of Colorado)

Abstract

Generalized strings describe various biological motifs that arise in molecular and computational biology. In this manuscript, we introduce an alternative but efficient algorithm to construct the minimal deterministic finite automaton (DFA) associated with any generalized string. We exploit this construction to characterize the typical growth of the minimal DFA (i.e., with the least number of states) associated with a random generalized string of increasing length. Even though the worst-case growth may be exponential, we characterize a point in the construction of the minimal DFA when it starts to grow linearly and conclude it has at most a polynomial number of states with asymptotically certain probability. We conjecture that this number is linear.

Suggested Citation

  • Ian G. Char & Manuel E. Lladser, 2020. "Stochastic Analysis of Minimal Automata Growth for Generalized Strings," Methodology and Computing in Applied Probability, Springer, vol. 22(1), pages 329-347, March.
  • Handle: RePEc:spr:metcap:v:22:y:2020:i:1:d:10.1007_s11009-019-09706-8
    DOI: 10.1007/s11009-019-09706-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-019-09706-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11009-019-09706-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Nuria Flames & Oliver Hobert, 2009. "Gene regulatory logic of dopamine neuron differentiation," Nature, Nature, vol. 458(7240), pages 885-889, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zihao Wang & Qian Zhang & Yayun Jiang & Jun Zhou & Ye Tian, 2024. "ASI-RIM neuronal axis regulates systemic mitochondrial stress response via TGF-β signaling cascade," Nature Communications, Nature, vol. 15(1), pages 1-13, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:metcap:v:22:y:2020:i:1:d:10.1007_s11009-019-09706-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.