{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:17Z","timestamp":1760203037839,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319537320"},{"type":"electronic","value":"9783319537337"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53733-7_31","type":"book-chapter","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T05:39:21Z","timestamp":1487137161000},"page":"421-434","source":"Crossref","is-referenced-by-count":0,"title":["Detecting Useless Transitions in Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Dick","family":"Grune","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wan","family":"Fokkink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Chatzikalymnios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brinio","family":"Hond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Rutgers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,16]]},"reference":[{"issue":"1","key":"31_CR1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1137\/S009753979528682X","volume":"29","author":"E Bertsch","year":"1999","unstructured":"Bertsch, E., Nederhof, M.-J.: Regular closure of deterministic languages. SIAM J. Comput. 29(1), 81\u2013102 (1999)","journal-title":"SIAM J. Comput."},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR 1997: Concurrency Theory","author":"A Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135\u2013150. Springer, Heidelberg (1997). doi: 10.1007\/3-540-63141-0_10"},{"key":"31_CR3","unstructured":"Chatzikalymnios, E.: Comparison of two algorithms for detecting useless transitions in pushdown automata. BSc. thesis, Vrije Universiteit Amsterdam (2016). http:\/\/www.cs.vu.nl\/~tcs\/chatzikalymnios-bscthesis.pdf"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/10722167_20","volume-title":"Computer Aided Verification","author":"J Esparza","year":"2000","unstructured":"Esparza, J., Hansel, D., Rossmanith, P., Schwoon, S.: Efficient algorithms for model checking pushdown systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 232\u2013247. Springer, Heidelberg (2000). doi: 10.1007\/10722167_20"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Finkel, A., Willems, B., Wolper, P.: A direct symbolic approach to model checking pushdown systems. In: INFINITY 1997. ENTCS, vol. 9, pp. 27\u201337. Elsevier (1997)","DOI":"10.1016\/S1571-0661(05)80426-8"},{"key":"31_CR6","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0304-3975(82)90110-4","volume":"18","author":"J Goldstine","year":"1982","unstructured":"Goldstine, J., Price, J.K., Wotschke, D.: A pushdown automaton or a context-free grammar - which is more economical? Theoret. Comput. Sci. 18, 33\u201340 (1982)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"31_CR7","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1109\/TAC.2005.863513","volume":"51","author":"C Griffin","year":"2006","unstructured":"Griffin, C.: A note on deciding controllability in pushdown systems. IEEE Trans. Autom. Control 51(2), 334\u2013337 (2006)","journal-title":"IEEE Trans. Autom. Control"},{"key":"31_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68954-8","volume-title":"Parsing Techniques - A Practical Guide","author":"D Grune","year":"2008","unstructured":"Grune, D., Jacobs, C.: Parsing Techniques - A Practical Guide, 2nd edn. Springer, Heidelberg (2008)","edition":"2"},{"key":"31_CR9","volume-title":"An Introduction to Formal Languages and Automata","author":"P Linz","year":"2011","unstructured":"Linz, P.: An Introduction to Formal Languages and Automata. Jones & Bartlett, Burlington (2011)"},{"issue":"3","key":"31_CR10","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1145\/233551.233555","volume":"43","author":"M-J Nederhof","year":"1996","unstructured":"Nederhof, M.-J., Bertsch, E.: Linear-time suffix parsing for deterministic languages. J. ACM 43(3), 524\u2013554 (1996)","journal-title":"J. ACM"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-61474-5_58","volume-title":"Computer Aided Verification","author":"I Walukiewicz","year":"1996","unstructured":"Walukiewicz, I.: Pushdown processes: games and model checking. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 62\u201374. Springer, Heidelberg (1996). doi: 10.1007\/3-540-61474-5_58"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53733-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T14:19:04Z","timestamp":1568816344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53733-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319537320","9783319537337"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53733-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}