{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:11:52Z","timestamp":1743149512982,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030642754"},{"type":"electronic","value":"9783030642761"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64276-1_9","type":"book-chapter","created":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T07:04:38Z","timestamp":1606201478000},"page":"161-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Star-Freeness, First-Order Definability and Aperiodicity of Structured Context-Free Languages"],"prefix":"10.1007","author":[{"given":"Dino","family":"Mandrioli","sequence":"first","affiliation":[]},{"given":"Matteo","family":"Pradella","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Crespi Reghizzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,25]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Arenas, M., Barcel\u00f3, P., Etessami, K., Immerman, N., Libkin, L.: First-order and temporal logics for nested words. In: Logical Methods in Computer Science, vol. 4, no. 4 (2008)","DOI":"10.2168\/LMCS-4(4:11)2008"},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516512.1516518","volume":"56","author":"R Alur","year":"2009","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3), 1\u201343 (2009)","journal-title":"J. ACM"},{"key":"9_CR3","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. Handbook of Model Checking, pp. 541\u2013572. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_17"},{"issue":"5","key":"9_CR4","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.1145\/2039346.2039347","volume":"33","author":"R Alur","year":"2011","unstructured":"Alur, R., Chaudhuri, S., Madhusudan, P.: Software model checking using languages of nested trees. ACM Trans. Program. Lang. Syst. 33(5), 15:1\u201315:45 (2011). https:\/\/doi.org\/10.1145\/2039346.2039347","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-59136-5_3","volume-title":"Handbook of Formal Languages","author":"J-M Autebert","year":"1997","unstructured":"Autebert, J.-M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 111\u2013174. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5_3"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-319-08587-6_33","volume-title":"Automated Reasoning","author":"L Bozzelli","year":"2014","unstructured":"Bozzelli, L., S\u00e1nchez, C.: Visibly linear temporal logic. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS (LNAI), vol. 8562, pp. 418\u2013433. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08587-6_33"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-12689-9_92","volume-title":"Foundations of Computation Theory","author":"B von Braunm\u00fchl","year":"1983","unstructured":"von Braunm\u00fchl, B., Verbeek, R.: Input-driven languages are recognized in log n space. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol. 158, pp. 40\u201351. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/3-540-12689-9_92"},{"issue":"1\u20136","key":"9_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"JR B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Math. Log. Q. 6(1\u20136), 66\u201392 (1960)","journal-title":"Math. Log. Q."},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Chiari, M., Mandrioli, D., Pradella, M.: Temporal logic and model checking for operator precedence languages. In: Orlandini, A., Zimmermann, M. (eds.) Proceedings Ninth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2018, Saarbr\u00fccken, Germany, 26\u201328th September 2018. EPTCS, vol. 277, pp. 161\u2013175 (2018). https:\/\/doi.org\/10.4204\/EPTCS.277.12","DOI":"10.4204\/EPTCS.277.12"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1145\/322092.322098","volume":"25","author":"S Crespi Reghizzi","year":"1978","unstructured":"Crespi Reghizzi, S., Guida, G., Mandrioli, D.: Noncounting context-free languages. J. ACM 25, 571\u2013580 (1978)","journal-title":"J. ACM"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1137\/0210013","volume":"10","author":"S Crespi Reghizzi","year":"1981","unstructured":"Crespi Reghizzi, S., Guida, G., Mandrioli, D.: Operator precedence grammars and the noncounting property. SICOMP: SIAM J. Comput. 10, 174\u2013191 (1981)","journal-title":"SICOMP: SIAM J. Comput."},{"issue":"6","key":"9_CR12","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.1016\/j.jcss.2011.12.006","volume":"78","author":"S Crespi Reghizzi","year":"2012","unstructured":"Crespi Reghizzi, S., Mandrioli, D.: Operator precedence and the visibly pushdown property. J. Comput. Syst. Sci. 78(6), 1837\u20131867 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0019-9958(78)90474-6","volume":"37","author":"S Crespi Reghizzi","year":"1978","unstructured":"Crespi Reghizzi, S., Mandrioli, D., Martin, D.F.: Algebraic properties of operator precedence languages. Inf. Control 37(2), 115\u2013133 (1978)","journal-title":"Inf. Control"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Crespi Reghizzi, S., Pradella, M.: Beyond operator-precedence grammars and languages. J. Comput. Syst. Sci. (2020). to appear","DOI":"10.1016\/j.jcss.2020.04.006"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/0020-0190(78)90033-9","volume":"7","author":"S Crespi Reghizzi","year":"1978","unstructured":"Crespi Reghizzi, S., Mandrioli, D.: A class of grammar generating non-counting languages. Inf. Process. Lett. 7(1), 24\u201326 (1978). https:\/\/doi.org\/10.1016\/0020-0190(78)90033-9","journal-title":"Inf. Process. Lett."},{"key":"9_CR16","unstructured":"Diekert, V., Gastin, P.: First-order definable languages. In: Logic and Automata: History and Perspectives, Texts in Logic and Games, pp. 261\u2013306. Amsterdam University Press (2008)"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"CC Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Am. Math. Soc. 98(1), 21\u201352 (1961)","journal-title":"Trans. Am. Math. Soc."},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-75414-5_12","volume-title":"Algebraic Informatics","author":"Z \u00c9sik","year":"2007","unstructured":"\u00c9sik, Z., Iv\u00e1n, S.: Aperiodicity in tree automata. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2007. LNCS, vol. 4728, pp. 189\u2013207. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75414-5_12"},{"issue":"3","key":"9_CR19","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1145\/321172.321179","volume":"10","author":"RW Floyd","year":"1963","unstructured":"Floyd, R.W.: Syntactic analysis and operator precedence. J. ACM 10(3), 316\u2013333 (1963)","journal-title":"J. ACM"},{"key":"9_CR20","volume-title":"Introduction to Formal Language Theory","author":"MA Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison Wesley, Boston (1978)"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1051\/ita\/1991250201251","volume":"25","author":"U Heuter","year":"1991","unstructured":"Heuter, U.: First-order properties of trees, star-free expressions, and aperiodicity. ITA 25, 125\u2013145 (1991). https:\/\/doi.org\/10.1051\/ita\/1991250201251","journal-title":"ITA"},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10849-006-9016-z","volume":"15","author":"T Langholm","year":"2006","unstructured":"Langholm, T.: A descriptive characterisation of linear languages. J. Log. Lang. Inf. 15(3), 233\u2013250 (2006). https:\/\/doi.org\/10.1007\/s10849-006-9016-z","journal-title":"J. Log. Lang. Inf."},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BFb0022257","volume-title":"Computer Science Logic","author":"C Lautemann","year":"1995","unstructured":"Lautemann, C., Schwentick, T., Th\u00e9rien, D.: Logics for context-free languages. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol. 933, pp. 205\u2013216. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0022257"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-319-20297-6_20","volume-title":"Computer Science \u2013 Theory and Applications","author":"V Lonati","year":"2015","unstructured":"Lonati, V., Mandrioli, D., Panella, F., Pradella, M.: First-order logic definability of free languages. In: Beklemishev, L.D., Musatov, D.V. (eds.) CSR 2015. LNCS, vol. 9139, pp. 310\u2013324. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20297-6_20"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Lonati, V., Mandrioli, D., Panella, F., Pradella, M.: Operator precedence languages: their automata-theoretic and logic characterization. SIAM J. Comput. 44(4), 1026\u20131088 (2015)","DOI":"10.1137\/140978818"},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.cosrev.2017.12.001","volume":"27","author":"D Mandrioli","year":"2018","unstructured":"Mandrioli, D., Pradella, M.: Generalizing input-driven languages: theoretical and practical benefits. Comput. Sci. Rev. 27, 61\u201387 (2018). https:\/\/doi.org\/10.1016\/j.cosrev.2017.12.001","journal-title":"Comput. Sci. Rev."},{"issue":"3","key":"9_CR27","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/321406.321411","volume":"14","author":"R McNaughton","year":"1967","unstructured":"McNaughton, R.: Parenthesis grammars. J. ACM 14(3), 490\u2013500 (1967)","journal-title":"J. ACM"},{"key":"9_CR28","volume-title":"Counter-Free Automata","author":"R McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-74456-6_13","volume-title":"Mathematical Foundations of Computer Science 2007","author":"D Nowotka","year":"2007","unstructured":"Nowotka, D., Srba, J.: Height-deterministic pushdown automata. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 125\u2013134. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74456-6_13"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Pin, J.: Logic on words. In: Current Trends in Theoretical Computer Science, pp. 254\u2013273 (2001)","DOI":"10.1016\/S0304-3975(99)00155-3"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-59293-8_185","volume-title":"TAPSOFT \u201995: Theory and Practice of Software Development","author":"C Floyd","year":"1995","unstructured":"Floyd, C.: Theory and practice of software development. In: Mosses, P.D., Nielsen, M., Schwartzbach, M.I. (eds.) CAAP 1995. LNCS, vol. 915, pp. 25\u201341. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59293-8_185"},{"issue":"1","key":"9_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-10(1:14)2014","volume":"10","author":"A Rabinovich","year":"2014","unstructured":"Rabinovich, A.: A proof of Kamp\u2019s theorem. Log. Methods Comput. Sci. 10(1), 1\u201316 (2014). https:\/\/doi.org\/10.2168\/LMCS-10(1:14)2014","journal-title":"Log. Methods Comput. Sci."},{"key":"9_CR33","volume-title":"Formal Languages","author":"AK Salomaa","year":"1973","unstructured":"Salomaa, A.K.: Formal Languages. Academic Press, New York (1973)"},{"key":"9_CR34","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","volume":"1","author":"J Thatcher","year":"1967","unstructured":"Thatcher, J.: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. J. Comput. Syst. Sci. 1, 317\u2013322 (1967)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR35","unstructured":"Thomas, W.: Logical aspects in the study of tree languages. In: Courcelle, B. (ed.) 9th Colloquium on Trees in Algebra and Programming, CAAP 1984, Bordeaux, France, March 5\u20137, 1984, Proceedings, pp. 31\u201350. Cambridge University Press (1984)"},{"key":"9_CR36","first-page":"326","volume":"140","author":"BA Trakhtenbrot","year":"1961","unstructured":"Trakhtenbrot, B.A.: Finite automata and logic of monadic predicates. Doklady Akademii Nauk SSR 140, 326\u2013329 (1961). (in Russian)","journal-title":"Doklady Akademii Nauk SSR"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64276-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T19:59:19Z","timestamp":1619294359000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64276-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030642754","9783030642761"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64276-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2020.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was planned to take place in Macau, China, and changed to a virtual format due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}