Exact descriptional complexity of determinization of input-driven pushdown automata
Abstract: The number of states and stack symbols needed to determinize nondeterministic input-driven pushdown automata (NIDPDA) working over a fixed alphabet is determined precisely. It is proved that in the worst case exactly 2{n2} states are needed to determinize an n-state NIDPDA, and the proof uses witness automata with a stack alphabet \Gamma = {0,1} working on strings over a 4-symbol input alphabet (Only an asymptotic lower bound was known before in the case of a fixed alphabet). Also, the impact of NIDPDA determinization on the size of stack alphabet is determined precisely for the first time: it is proved that s(2{n2}-1) stack symbols are necessary in the worst case to determinize an n-state NIDPDA working over an input alphabet of size s+5 with s left brackets (The previous lower bound was only asymptotic in the number of states and did not depend on the number of left brackets).
- R. Alur, P. Madhusudan, “Visibly pushdown languages”, ACM Symposium on Theory of Computing (STOC 2004, Chicago, USA, 13–16 June 2004), 202–211.
- R. Alur, P. Madhusudan, “Adding nesting structure to words”, Journal of the ACM, 56:3 (2009), 1–43.
- B. von Braunmühl, R. Verbeek, “Input driven languages are recognized in logn𝑛\log nroman_log italic_n space”, Annals of Discrete Mathematics, 24 (1985), 1–20.
- Y.-S. Han, S.-K. Ko, K. Salomaa, “Deciding path size of nondeterministic (and input-driven) pushdown automata”, Theoretical Computer Science, 939, 2023, 170–181.
- G. Jirásková, A. Okhotin, “Towards exact state complexity bounds for input-driven pushdown automata”, Developments in Language Theory (DLT 2018, Tokyo, Japan, 10–14 September 2018), LNCS 11088, 441–452.
- M. Kutrib, A. Malcher, M. Wendlandt, “Tinput-Driven Pushdown, Counter, and Stack Automata”, Fundamenta Informaticae, 155:1–2 (2017), 59–88.
- K. Mehlhorn, “Pebbling mountain ranges and its application to DCFL-recognition”, Automata, Languages and Programming (ICALP 1980, Noordweijkerhout, The Netherlands, 14–18 July 1980), LNCS 85, 422–435.
- M. Ogawa, A. Okhotin, “On the Determinization of Event-Clock Input-Driven Pushdown Automata”, Computer Science–Theory and Applications: 17th International Computer Science Symposium in Russia (CSR 2022, Virtual Event, June 29 – July 1, 2022), LNCS 13296, 256–268.
- A. Okhotin, X. Piao, K. Salomaa, “Descriptional complexity of input-driven pushdown automata”, Languages Alive: Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday, LNCS 7300, 2012, 186–206.
- A. Okhotin, K. Salomaa, “Complexity of input-driven pushdown automata” ACM SIGACT News, 45:2 (2014) 47–67.
- A. Okhotin, K. Salomaa, “State complexity of operations on input-driven pushdown automata.”, Journal of Computer and System Sciences, 86, 207–228 (2017).
- A. Rose, A. Okhotin, “Probabilistic Input-Driven Pushdown Automata”, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), LIPIcs 272, 2023, 78:1–78:14.
- W. Rytter, “An application of Mehlhorn’s algorithm for bracket languages to log n space recognition of input-driven languages”, Information Processing Letters, 23, 81–84 (1986).
- N. Van Tang, M. Ogawa, “Event-clock visibly pushdown automata”, Theory and Practice of Computer Science (SOFSEM 2009), LNCS 5404, 2009, 558–569.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.