×

Found 712 Documents (Results 1–100)

Unboundedness problems for machines with reversal-bounded counters. (English) Zbl 07770340

Kupferman, Orna (ed.) et al., Foundations of software science and computation structures. 26th international conference, FOSSACS 2023, held as part of the European joint conferences on theory and practice of software, ETAPS 2023, Paris, France, April 22–27, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13992, 240-264 (2023).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Pushdown and one-counter automata: constant and non-constant memory usage. (English) Zbl 07729464

Bordihn, Henning (ed.) et al., Descriptional complexity of formal systems. 25th IFIP WG 1.02 international conference, DCFS 2023, Potsdam, Germany, July 4–6, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13918, 146-157 (2023).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Model checking temporal properties of recursive probabilistic programs. (English) Zbl 07793042

Bouyer, Patricia (ed.) et al., 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. Cham: Springer. Lect. Notes Comput. Sci. 13242, 449-469 (2022).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the determinization of event-clock input-driven pushdown automata. (English) Zbl 07615742

Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 17th international computer science symposium in Russia, CSR 2022, virtual event, June 29 – July 1, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13296, 256-268 (2022).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Synchronizing words for real-time deterministic pushdown automata (extended abstract). (English) Zbl 07597664

Giri, Debasis (ed.) et al., Proceedings of the seventh international conference on mathematics and computing, ICMC 2021, Shibpur, India, March 2–5, 2021. Singapore: Springer. Adv. Intell. Syst. Comput. 1412, 551-562 (2022).
MSC:  68-XX 03-XX
PDFBibTeX XMLCite
Full Text: DOI

Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata. (English) Zbl 1507.68173

Diekert, Volker (ed.) et al., Developments in language theory. 26th international conference, DLT 2022, Tampa, FL, USA, May 9–13, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13257, 312-324 (2022).
MSC:  68Q45 68Q30
PDFBibTeX XMLCite
Full Text: DOI

Adaptive synchronisation of pushdown automata. (English) Zbl 07730619

Haddad, Serge (ed.) et al., 32nd international conference on concurrency theory, CONCUR 2021, August 24–27, 2021, virtual conference. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 203, Article 17, 15 p. (2021).
MSC:  68Q85
PDFBibTeX XMLCite
Full Text: DOI arXiv

Inclusion testing of Büchi automata based on well-quasiorders. (English) Zbl 07730605

Haddad, Serge (ed.) et al., 32nd international conference on concurrency theory, CONCUR 2021, August 24–27, 2021, virtual conference. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 203, Article 3, 22 p. (2021).
MSC:  68Q85
PDFBibTeX XMLCite
Full Text: DOI

A bit of nondeterminism makes pushdown automata expressive and succinct. (English) Zbl 07724226

Bonchi, Filippo (ed.) et al., 46th international symposium on mathematical foundations of computer science, MFCS 2021, August 23–27, 2021, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 202, Article 53, 20 p. (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Fast zone-based algorithms for reachability in pushdown timed automata. (English) Zbl 1493.68181

Silva, Alexandra (ed.) et al., Computer aided verification. 33rd international conference, CAV 2021, virtual event, July 20–23, 2021. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12759, 619-642 (2021).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv

Revisiting underapproximate reachability for multipushdown systems. (English) Zbl 1507.68080

Biere, Armin (ed.) et al., Tools and algorithms for the construction and analysis of systems. 26th international conference, TACAS 2020, held as part of the European joint conferences on theory and practice of software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12078, 387-404 (2020).
MSC:  68N30 68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv

Good-for-games \(\omega \)-pushdown automata. (English) Zbl 1518.68181

Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 689-702 (2020).
MSC:  68Q45 91A80
PDFBibTeX XMLCite
Full Text: DOI arXiv

Bisimulation finiteness of pushdown systems is elementary. (English) Zbl 07299493

Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 521-534 (2020).
MSC:  68-XX
PDFBibTeX XMLCite
Full Text: DOI arXiv

Intersection and union hierarchies of deterministic context-free languages and pumping lemmas. (English) Zbl 1437.68108

Leporati, Alberto (ed.) et al., Language and automata theory and applications. 14th international conference, LATA 2020, Milan, Italy, March 4–6, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12038, 341-353 (2020).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv

Boolean algebras from trace automata. (English) Zbl 07650345

Chattopadhyay, Arkadev (ed.) et al., 39th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2019, Bombay, India, December 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 150, Article 48, 15 p. (2019).
MSC:  68N30 68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Greibach normal form for \(\omega\)-algebraic systems and weighted simple \(\omega\)-pushdown automata. (English) Zbl 1504.68098

Chattopadhyay, Arkadev (ed.) et al., 39th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2019, Bombay, India, December 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 150, Article 38, 14 p. (2019).
MSC:  68Q45 68Q42 68Q70
PDFBibTeX XMLCite
Full Text: DOI

Behavioral strengths and weaknesses of various models of limited automata. (English) Zbl 1445.68128

Catania, Barbara (ed.) et al., SOFSEM 2019: theory and practice of computer science. 45th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11376, 519-530 (2019).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv

An improved proof of the closure under homomorphic inverse of FCFL valued in lattice-ordered monoids. (English) Zbl 1452.68110

Sun, Xiaoming (ed.) et al., Theoretical computer science. 37th national conference, NCTCS 2019, Lanzhou, China, August 2–4, 2019. Revised selected papers. Singapore: Springer. Commun. Comput. Inf. Sci. 1069, 64-75 (2019).
MSC:  68Q45 68Q42
PDFBibTeX XMLCite
Full Text: DOI

Limited nondeterminism of input-driven pushdown automata: decidability and complexity. (English) Zbl 1434.68256

Hospodár, Michal (ed.) et al., Descriptional complexity of formal systems. 21st IFIP WG 1.02 international conference, DCFS 2019, Košice, Slovakia, July 17–19, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11612, 158-170 (2019).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Enhancement of automata with jumping modes. (English) Zbl 1425.68195

Castillo-Ramirez, Alonso (ed.) et al., Cellular automata and discrete complex systems. 25th IFIP WG 1.5 international workshop, AUTOMATA 2019, Guadalajara, Mexico, June 26–28, 2019, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11525, 62-76 (2019).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

On the boundedness problem for higher-order pushdown vector addition systems. (English) Zbl 07561349

Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 44, 20 p. (2018).
MSC:  68Q85 68Q45
PDFBibTeX XMLCite
Full Text: DOI

Temporal logic and model checking for operator precedence languages. (English) Zbl 07447741

Orlandini, Andrea (ed.) et al., Proceedings of the ninth international symposium on games, automata, logics, and formal verification, GandALF 2018, Saarbrücken, Germany, September 26–28, 2018. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 277, 161-175 (2018).
MSC:  68Q60 03B44 68Q45
PDFBibTeX XMLCite
Full Text: arXiv Link

Parity to safety in polynomial time for pushdown and collapsible pushdown systems. (English) Zbl 1512.68154

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 57, 15 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Optimal strategies in pushdown reachability games. (English) Zbl 1512.68150

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 42, 14 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms. (English) Zbl 1499.68169

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 118, 14 p. (2018).
MSC:  68Q45 03C10 03F30
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software