Document Open Access Logo

Probabilistic Input-Driven Pushdown Automata

Authors Alex Rose , Alexander Okhotin



PDF
Thumbnail PDF

File

LIPIcs.MFCS.2023.78.pdf
  • Filesize: 0.69 MB
  • 14 pages

Document Identifiers

Author Details

Alex Rose
  • Department of Mathematics and Computer Science, Saint Petersburg State University, Russia
Alexander Okhotin
  • Department of Mathematics and Computer Science, Saint Petersburg State University, Russia

Cite AsGet BibTex

Alex Rose and Alexander Okhotin. Probabilistic Input-Driven Pushdown Automata. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 78:1-78:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.MFCS.2023.78

Abstract

A probabilistic variant of input-driven pushdown automata (IDPDA), also known as visibly pushdown automata, is introduced. It is proved that these automata can be determinized: an n-state probabilistic IDPDA that accepts each string with probability at least λ+δ or at most λ-δ is transformed to a deterministic IDPDA with at most (1 + 1/δ)^(n² - n) states recognizing the same language. An asymptotically close lower bound is provided: for infinitely many n, there is a probabilistic IDPDA with 4n + 1 states and δ = 1/(270n), such that every equivalent deterministic IDPDA needs at least 7^(n²/14) states. A few special cases of automata with reduced determinization complexity are identified.

Subject Classification

ACM Subject Classification
  • Theory of computation → Probabilistic computation
  • Theory of computation → Formal languages and automata theory
Keywords
  • Finite automata
  • probabilistic automata
  • input-driven automata
  • visibly pushdown automata
  • state complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Rajeev Alur, Viraj Kumar, P. Madhusudan, and Mahesh Viswanathan. Congruences for visibly pushdown languages. In Luís Caires, Giuseppe F. Italiano, Luís Monteiro, Catuscia Palamidessi, and Moti Yung, editors, Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, volume 3580 of Lecture Notes in Computer Science, pages 1102-1114. Springer, 2005. URL: https://doi.org/10.1007/11523468_89.
  2. Rajeev Alur and P. Madhusudan. Visibly pushdown languages. In László Babai, editor, Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pages 202-211. ACM, 2004. URL: https://doi.org/10.1145/1007352.1007390.
  3. Rajeev Alur and P. Madhusudan. Adding nesting structure to words. J. ACM, 56(3):16:1-16:43, 2009. URL: https://doi.org/10.1145/1516512.1516518.
  4. Andris Ambainis. The complexity of probabilistic versus deterministic finite automata. In Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, and Subhash Suri, editors, Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings, volume 1178 of Lecture Notes in Computer Science, pages 233-238. Springer, 1996. URL: https://doi.org/10.1007/BFb0009499.
  5. Nathalie Bertrand, Serge Haddad, and Engel Lefaucheux. Diagnosis in infinite-state probabilistic systems. In Josée Desharnais and Radha Jagadeesan, editors, 27th International Conference on Concurrency Theory, CONCUR 2016, August 23-26, 2016, Québec City, Canada, volume 59 of LIPIcs, pages 37:1-37:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. URL: https://doi.org/10.4230/LIPIcs.CONCUR.2016.37.
  6. Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano, and Giovanni Pighizzini. On the size of unary probabilistic and nondeterministic automata. Fundam. Informaticae, 112(2-3):119-135, 2011. URL: https://doi.org/10.3233/FI-2011-583.
  7. Laura Bozzelli. Alternating automata and a temporal fixpoint calculus for visibly pushdown languages. In Luís Caires and Vasco Thudichum Vasconcelos, editors, CONCUR 2007 - Concurrency Theory, 18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007, Proceedings, volume 4703 of Lecture Notes in Computer Science, pages 476-491. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-74407-8_32.
  8. Laura Bozzelli, Aniello Murano, and Adriano Peron. Event-clock nested automata. In Shmuel Tomi Klein, Carlos Martín-Vide, and Dana Shapira, editors, Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings, volume 10792 of Lecture Notes in Computer Science, pages 80-92. Springer, 2018. URL: https://doi.org/10.1007/978-3-319-77313-1_6.
  9. Vojtech Forejt, Petr Jancar, Stefan Kiefer, and James Worrell. Game characterization of probabilistic bisimilarity, and applications to pushdown automata. Log. Methods Comput. Sci., 14(4), 2018. URL: https://doi.org/10.23638/LMCS-14(4:13)2018.
  10. Rusins Freivalds. Language recognition using probabilistic turing machines in real time, and automata with a push-down store. Probl. Inform. Transm., 15(4):319-323, 1979. Google Scholar
  11. Rusins Freivalds. On the growth of the number of states in result of determinization of probabilistic finite automata. Avtomatika i Viciskitelnaja Tehnika, 3:39-42, 1982. Google Scholar
  12. Rusins Freivalds. Non-constructive methods for finite probabilistic automata. Int. J. Found. Comput. Sci., 19(3):565-580, 2008. URL: https://doi.org/10.1142/S0129054108005826.
  13. Juraj Hromkovic and Georg Schnitger. On probabilistic pushdown automata. Inf. Comput., 208(8):982-995, 2010. URL: https://doi.org/10.1016/j.ic.2009.11.001.
  14. Martin Kutrib, Andreas Malcher, and Matthias Wendlandt. Tinput-driven pushdown, counter, and stack automata. Fundam. Informaticae, 155(1-2):59-88, 2017. URL: https://doi.org/10.3233/FI-2017-1576.
  15. Christof Löding, P. Madhusudan, and Olivier Serre. Visibly pushdown games. In Kamal Lodaya and Meena Mahajan, editors, FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings, volume 3328 of Lecture Notes in Computer Science, pages 408-420. Springer, 2004. URL: https://doi.org/10.1007/978-3-540-30538-5_34.
  16. Kurt Mehlhorn. Pebbling moutain ranges and its application of dcfl-recognition. In J. W. de Bakker and Jan van Leeuwen, editors, Automata, Languages and Programming, 7th Colloquium, Noordweijkerhout, The Netherlands, July 14-18, 1980, Proceedings, volume 85 of Lecture Notes in Computer Science, pages 422-435. Springer, 1980. URL: https://doi.org/10.1007/3-540-10003-2_89.
  17. Carlo Mereghetti, Beatrice Palano, and Giovanni Pighizzini. Note on the succinctness of deterministic, nondeterministic, probabilistic and quantum finite automata. RAIRO Theor. Informatics Appl., 35(5):477-490, 2001. URL: https://doi.org/10.1051/ita:2001106.
  18. Massimiliano Milani and Giovanni Pighizzini. Tight bounds on the simulation of unary probabilistic automata by deterministic automata. J. Autom. Lang. Comb., 6(4):481-492, 2001. URL: https://doi.org/10.25596/jalc-2001-481.
  19. Mizuhito Ogawa and Alexander Okhotin. On the determinization of event-clock input-driven pushdown automata. In Alexander S. Kulikov and Sofya Raskhodnikova, editors, Computer Science - Theory and Applications - 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 - July 1, 2022, Proceedings, volume 13296 of Lecture Notes in Computer Science, pages 256-268. Springer, 2022. URL: https://doi.org/10.1007/978-3-031-09574-0_16.
  20. Alexander Okhotin, Xiaoxue Piao, and Kai Salomaa. Descriptional complexity of input-driven pushdown automata. In Henning Bordihn, Martin Kutrib, and Bianca Truthe, editors, Languages Alive - Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday, volume 7300 of Lecture Notes in Computer Science, pages 186-206. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-31644-9_13.
  21. Alexander Okhotin and Kai Salomaa. Descriptional complexity of unambiguous input-driven pushdown automata. Theor. Comput. Sci., 566:1-11, 2015. URL: https://doi.org/10.1016/j.tcs.2014.11.015.
  22. Alexander Okhotin and Victor L. Selivanov. Input-driven pushdown automata on well-nested infinite strings. In Rahul Santhanam and Daniil Musatov, editors, Computer Science - Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28 - July 2, 2021, Proceedings, volume 12730 of Lecture Notes in Computer Science, pages 349-360. Springer, 2021. URL: https://doi.org/10.1007/978-3-030-79416-3_21.
  23. Michael O. Rabin. Probabilistic automata. Inf. Control., 6(3):230-245, 1963. URL: https://doi.org/10.1016/S0019-9958(63)90290-0.
  24. Nguyen Van Tang and Mizuhito Ogawa. Event-clock visibly pushdown automata. In Mogens Nielsen, Antonín Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, and Frank D. Valencia, editors, SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings, volume 5404 of Lecture Notes in Computer Science, pages 558-569. Springer, 2009. URL: https://doi.org/10.1007/978-3-540-95891-8_50.
  25. Burchard von Braunmühl and Rutger Verbeek. Input driven languages are recognized in log n space. In Marek Karplnski and Jan van Leeuwen, editors, Topics in the Theory of Computation, volume 102 of North-Holland Mathematics Studies, pages 1-19. North-Holland, 1985. URL: https://doi.org/10.1016/S0304-0208(08)73072-X.
  26. Tobias Winkler, Christina Gehnen, and Joost-Pieter Katoen. Model checking temporal properties of recursive probabilistic programs. In Patricia Bouyer and Lutz Schröder, editors, Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings, volume 13242 of Lecture Notes in Computer Science, pages 449-469. Springer, 2022. URL: https://doi.org/10.1007/978-3-030-99253-8_23.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail