{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:31:05Z","timestamp":1743010265150,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500252"},{"type":"electronic","value":"9783030500269"}],"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-50026-9_4","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"46-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Second-Order Finite Automata"],"prefix":"10.1007","author":[{"given":"Alexsander Andrade","family":"de Melo","sequence":"first","affiliation":[]},{"given":"Mateus","family":"de Oliveira Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-319-12691-3_33","volume-title":"Combinatorial Optimization and Applications","author":"B Bollig","year":"2014","unstructured":"Bollig, B.: On the width of ordered binary decision diagrams. In: Zhang, Z., Wu, L., Xu, W., Du, D.-Z. (eds.) COCOA 2014. LNCS, vol. 8881, pp. 444\u2013458. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-12691-3_33"},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/s00224-015-9657-x","volume":"59","author":"B Bollig","year":"2016","unstructured":"Bollig, B.: On the minimization of (complete) ordered binary decision diagrams. Theory Comput. Syst. 59(3), 532\u2013559 (2016)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.entcs.2005.11.015","volume":"149","author":"A Bouajjani","year":"2006","unstructured":"Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract regular tree model checking. Electron. Notes Theoret. Comput. Sci. 149(1), 37\u201348 (2006)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"issue":"1\u20133","key":"4_CR4","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2007.11.022","volume":"393","author":"S Bozapalidis","year":"2008","unstructured":"Bozapalidis, S., Kalampakas, A.: Graph automata. Theoret. Comput. Sci. 393(1\u20133), 147\u2013165 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: On recognizable sets and tree automata. In: Algebraic Techniques, pp. 93\u2013126. Elsevier (1989)","DOI":"10.1016\/B978-0-12-046370-1.50009-7"},{"key":"4_CR6","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)"},{"key":"4_CR7","unstructured":"Courcelle, B., Durand, I.: Verifying monadic second order graph properties with tree automata. In: Rhodes, C. (ed.) 3rd European Lisp Symposium, ELS, pp. 7\u201321. ELSAA (2010)"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Ebbinghaus, H.D., Flum, J.: Finite automata and logic: a microcosm of finite model theory. In: Finite Model Theory, pp. 107\u2013118. Springer, Heidelberg (1995). \nhttps:\/\/doi.org\/10.1007\/978-3-662-03182-7_6","DOI":"10.1007\/978-3-662-03182-7_6"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Erg\u00fcn, F., Kumar, R., Rubinfeld, R.: On learning bounded-width branching programs. In: Maass, W. (ed.) Proceedings of the Eighth Annual Conference on Computational Learning Theory, COLT, pp. 361\u2013368. ACM (1995)","DOI":"10.1145\/225298.225342"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Forbes, M.A., Kelley, Z.: Pseudorandom generators for read-once branching programs, in any order. In: Thorup, M. (ed.) 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 946\u2013955. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00093"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Giammarresi, D., Restivo, A.: Recognizable picture languages. Int. J. Pattern Recogn. Artif. Intell. 6(02n03), 241\u2013256 (1992)","DOI":"10.1142\/S021800149200014X"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BFb0023731","volume-title":"Computer-Aided Verification","author":"P Godefroid","year":"1991","unstructured":"Godefroid, P.: Using partial orders to improve automatic verification methods. In: Clarke, E.M., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol. 531, pp. 176\u2013185. Springer, Heidelberg (1991). \nhttps:\/\/doi.org\/10.1007\/BFb0023731"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.: An $$n \\log n$$ algorithm for minimizing states in a finite automaton. In: Theory of Machines and Computations, pp. 189\u2013196. Elsevier (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"issue":"3","key":"4_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0304-3975(83)90113-5","volume":"25","author":"L Priese","year":"1983","unstructured":"Priese, L.: Automata and concurrency. Theoret. Comput. Sci. 25(3), 221\u2013265 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/BFb0030586","volume-title":"TAPSOFT \u201997: Theory and Practice of Software Development","author":"W Thomas","year":"1997","unstructured":"Thomas, W.: Automata theory on trees and partial orders. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997. LNCS, vol. 1214, pp. 20\u201338. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/BFb0030586"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:56Z","timestamp":1592780576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_4","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":"22 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","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":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.org\/","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":"49","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":"25","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":"51% - 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":">= 3","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":"7","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 cancelled as a live conference due to the corona 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)"}}]}}