{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:02:23Z","timestamp":1743127343401,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031562211"},{"type":"electronic","value":"9783031562228"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-56222-8_15","type":"book-chapter","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T08:02:30Z","timestamp":1710835350000},"page":"255-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing $$\\textit{pre}^{*}$$ for\u00a0General Context Free Grammars"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0177-8028","authenticated-orcid":false,"given":"Peter","family":"Rossmanith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,20]]},"reference":[{"issue":"4","key":"15_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/0201022","volume":"1","author":"AV Aho","year":"1972","unstructured":"Aho, A.V., Peterson, T.G.: A minimum distance error-correcting parser for context-free languages. SIAM J. Comput. 1(4), 305\u2013312 (1972). https:\/\/doi.org\/10.1137\/0201022","journal-title":"SIAM J. Comput."},{"key":"15_CR2","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Addison-Wesley Series in Computer Science. World Student Series Edition. Addison-Wesley (1986). https:\/\/www.worldcat.org\/oclc\/12285707"},{"key":"15_CR3","volume-title":"Principles of Compiler Design","author":"AV Aho","year":"1977","unstructured":"Aho, A.V., Ullman, J.D.: Principles of Compiler Design. Pearson, London (1977)"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Alman, J., Vassilevska Williams, V.: A refined laser method and faster matrix multiplication. In: Marx, D. (ed.) Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 522\u2013539. SIAM (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.32","DOI":"10.1137\/1.9781611976465.32"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-319-10575-8_17","volume-title":"Handbook of Model Checking","author":"R Alur","year":"2018","unstructured":"Alur, R., Bouajjani, A., Esparza, J.: Model checking procedural programs. In: Clarke, E., Henzinger, T., Veith, H., Bloem, R. (eds.) Handbook of Model Checking, pp. 541\u2013572. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_17"},{"key":"15_CR6","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-030-59152-6_8","volume-title":"Automated Technology for Verification and Analysis","author":"AR Balasubramanian","year":"2020","unstructured":"Balasubramanian, A.R., Esparza, J., Lazi\u0107, M.: Complexity of verification and synthesis of threshold automata. In: Hung, D.V., Sokolsky, O. (eds.) ATVA 2020. LNCS, vol. 12302, pp. 144\u2013160. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59152-6_8"},{"key":"15_CR8","doi-asserted-by":"publisher","unstructured":"Bernardy, J., Claessen, K.: Efficient divide-and-conquer parsing of practical context-free languages. In: Morrisett, G., Uustalu, T. (eds.) ACM SIGPLAN International Conference on Functional Programming, pp. 111\u2013122. ACM (2013). https:\/\/doi.org\/10.1145\/2500365.2500576","DOI":"10.1145\/2500365.2500576"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Book, R.V., Otto, F.: String-Rewriting Systems. Texts and Monographs in Computer Science. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/978-1-4613-9771-7","DOI":"10.1007\/978-1-4613-9771-7"},{"issue":"5\u20136","key":"15_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0020-0190(00)00055-7","volume":"74","author":"A Bouajjani","year":"2000","unstructured":"Bouajjani, A., et al.: An efficient automata approach to some problems on context-free grammars. Inf. Process. Lett. 74(5\u20136), 221\u2013227 (2000). https:\/\/doi.org\/10.1016\/S0020-0190(00)00055-7","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/S10703-012-0166-0","volume":"43","author":"T Br\u00e1zdil","year":"2013","unstructured":"Br\u00e1zdil, T., Esparza, J., Kiefer, S., Ku\u010dera, A.: Analyzing probabilistic pushdown automata. Formal Methods Syst. Des. 43(2), 124\u2013163 (2013). https:\/\/doi.org\/10.1007\/S10703-012-0166-0","journal-title":"Formal Methods Syst. Des."},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Cocke, J.: Global common subexpression elimination. In: Northcote, R.S. (ed.) Proceedings of a Symposium on Compiler Optimization, Urbana-Champaign, Illinois, USA, pp. 20\u201324. ACM (1970). https:\/\/doi.org\/10.1145\/800028.808480","DOI":"10.1145\/800028.808480"},{"issue":"11","key":"15_CR13","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/TC.1968.226868","volume":"17","author":"J Earley","year":"1968","unstructured":"Earley, J.: R68\u201346 use of transition matrices in compiling. IEEE Trans. Comput. 17(11), 1098 (1968). https:\/\/doi.org\/10.1109\/TC.1968.226868","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/362007.362035","volume":"13","author":"J Earley","year":"1970","unstructured":"Earley, J.: An efficient context-free parsing algorithm. Commun. ACM 13(2), 94\u2013102 (1970). https:\/\/doi.org\/10.1145\/362007.362035","journal-title":"Commun. ACM"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-45007-6_2","volume-title":"Developments in Language Theory","author":"J Esparza","year":"2003","unstructured":"Esparza, J.: An automata-theoretic approach to software verification. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol. 2710, p. 21. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45007-6_2"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-79121-6_1","volume-title":"Implementation and Application of Automata","author":"J Esparza","year":"2021","unstructured":"Esparza, J.: Back to the future: a fresh look at linear temporal logic. In: Maneth, S. (ed.) CIAA 2021. LNCS, vol. 12803, pp. 3\u201313. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79121-6_1"},{"key":"15_CR17","volume-title":"Automata Theory: An Algorithmic Approach","author":"J Esparza","year":"2023","unstructured":"Esparza, J., Blondin, M.: Automata Theory: An Algorithmic Approach. The MIT Press, Cambridge (2023)"},{"key":"15_CR18","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). https:\/\/doi.org\/10.1007\/10722167_20"},{"key":"15_CR19","doi-asserted-by":"publisher","unstructured":"Esparza, J., Kupferman, O., Vardi, M.Y.: Verification. In: Pin, J. (ed.) Handbook of Automata Theory, pp. 1415\u20131456. European Mathematical Society Publishing House, Z\u00fcrich (2021). https:\/\/doi.org\/10.4171\/AUTOMATA-2\/16","DOI":"10.4171\/AUTOMATA-2\/16"},{"issue":"2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0890-5401(03)00139-1","volume":"186","author":"J Esparza","year":"2003","unstructured":"Esparza, J., Ku\u010dera, A., Schwoon, S.: Model checking LTL with regular valuations for pushdown systems. Inf. Comput. 186(2), 355\u2013376 (2003). https:\/\/doi.org\/10.1016\/S0890-5401(03)00139-1","journal-title":"Inf. Comput."},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-662-54577-5_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Esparza","year":"2017","unstructured":"Esparza, J., K\u0159et\u00ednsk\u00fd, J., Raskin, J.-F., Sickert, S.: From LTL and limit-deterministic B\u00fcchi automata to deterministic parity automata. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 426\u2013442. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_25"},{"key":"15_CR22","doi-asserted-by":"publisher","unstructured":"Esparza, J., K\u0159et\u00ednsk\u00fd, J., Sickert, S.: One theorem to rule them all: a unified translation of LTL into $$\\omega $$-automata. In: Dawar, A., Gr\u00e4del, E. (eds.) Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS, pp. 384\u2013393. ACM (2018). https:\/\/doi.org\/10.1145\/3209108.3209161","DOI":"10.1145\/3209108.3209161"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Esparza, J., Lammich, P., Neumann, R., Nipkow, T., Schimpf, A., Smaus, J.: A fully verified executable LTL model checker. Arch. Formal Proofs 2014 (2014). https:\/\/www.isa-afp.org\/entries\/CAVA_LTL_Modelchecker.shtml","DOI":"10.1007\/978-3-642-39799-8_31"},{"key":"15_CR24","doi-asserted-by":"publisher","unstructured":"Esparza, J., Podelski, A.: Efficient algorithms for pre$$^*$$ and post$$^*$$ on interprocedural parallel flow graphs. In: Wegman, M.N., Reps, T.W. (eds.) Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2000, pp. 1\u201311. ACM (2000). https:\/\/doi.org\/10.1145\/325694.325697","DOI":"10.1145\/325694.325697"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BFb0052083","volume-title":"Foundations of Computer Science","author":"J Esparza","year":"1997","unstructured":"Esparza, J., Rossmanith, P.: An automata approach to some problems on context-free grammars. In: Freksa, C., Jantzen, M., Valk, R. (eds.) Foundations of Computer Science. LNCS, vol. 1337, pp. 143\u2013152. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052083"},{"key":"15_CR26","first-page":"169","volume":"72","author":"J Esparza","year":"2000","unstructured":"Esparza, J., Rossmanith, P., Schwoon, S.: A uniform framework for problems on context-free grammars. Bull. EATCS 72, 169\u2013177 (2000)","journal-title":"Bull. EATCS"},{"key":"15_CR27","doi-asserted-by":"publisher","unstructured":"Ganty, P., Valero, P.: Regular expression search on compressed text. In: Bilgin, A., Marcellin, M.W., Serra-Sagrist\u00e0, J., Storer, J.A. (eds.) Data Compression Conference, DCC, pp. 528\u2013537. IEEE (2019). https:\/\/doi.org\/10.1109\/DCC.2019.00061","DOI":"10.1109\/DCC.2019.00061"},{"key":"15_CR28","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Boston (1979)"},{"key":"15_CR29","unstructured":"Kasami, T.: An efficient recognition and syntax-analysis algorithm for context-free languages. Technical report, R-257, University of Illinois-Urbana, March 1966"},{"key":"15_CR30","unstructured":"Lange, M., Lei\u00df, H.: To CNF or not to CNF? An efficient yet presentable version of the CYK algorithm. Informatica Didact. 8 (2009). http:\/\/www.informatica-didactica.de\/cmsmadesimple\/index.php?page=LangeLeiss2009"},{"key":"15_CR31","doi-asserted-by":"publisher","unstructured":"Luttenberger, M., Palenta, R., Seidl, H.: Computing the longest common prefix of a context-free language in polynomial time. In: Niedermeier, R., Vall\u00e9e, B. (eds.) 35th Symposium on Theoretical Aspects of Computer Science, STACS. LIPIcs, vol. 96, pp. 48:1\u201348:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPICS.STACS.2018.48","DOI":"10.4230\/LIPICS.STACS.2018.48"},{"issue":"2","key":"15_CR32","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/S0022-0000(75)80046-8","volume":"10","author":"LG Valiant","year":"1975","unstructured":"Valiant, L.G.: General context-free recognition in less than cubic time. J. Comput. Syst. Sci. 10(2), 308\u2013315 (1975). https:\/\/doi.org\/10.1016\/S0022-0000(75)80046-8","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR33","unstructured":"Wirth, N.: Algorithms + Data Structures = Programs. Prentice-Hall (1975)"},{"issue":"2","key":"15_CR34","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0019-9958(67)80007-X","volume":"10","author":"DH Younger","year":"1967","unstructured":"Younger, D.H.: Recognition and parsing of context-free languages in time $$n^3$$. Inf. Control 10(2), 189\u2013208 (1967). https:\/\/doi.org\/10.1016\/S0019-9958(67)80007-X","journal-title":"Inf. Control"},{"key":"15_CR35","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/J.IC.2018.02.006","volume":"261","author":"H Yu","year":"2018","unstructured":"Yu, H.: An improved combinatorial algorithm for Boolean matrix multiplication. Inf. Comput. 261, 240\u2013247 (2018). https:\/\/doi.org\/10.1016\/J.IC.2018.02.006","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Taming the Infinities of Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56222-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T22:03:24Z","timestamp":1730930604000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56222-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031562211","9783031562228"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56222-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"20 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"I have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}}]}}