{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:58Z","timestamp":1759639078062,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030134341"},{"type":"electronic","value":"9783030134358"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-13435-8_20","type":"book-chapter","created":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T15:18:36Z","timestamp":1550071116000},"page":"275-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Logic and Rational Languages of Scattered and Countable Series-Parallel Posets"],"prefix":"10.1007","author":[{"given":"Amazigh","family":"Amrane","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Bedon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,14]]},"reference":[{"issue":"4:2","key":"20_CR1","first-page":"1","volume":"11","author":"N Bedon","year":"2015","unstructured":"Bedon, N.: Logic and branching automata. Log. Meth. Comput. Sci. 11(4:2), 1\u201338 (2015)","journal-title":"Log. Meth. Comput. Sci."},{"issue":"25","key":"20_CR2","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1142\/S0129054118420042","volume":"19","author":"N Bedon","year":"2018","unstructured":"Bedon, N.: Complementation of branching automata for scattered and countable N-free posets. Int. J. Found. Comput. Sci. 19(25), 769\u2013799 (2018)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"20_CR3","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/s00224-009-9222-6","volume":"46","author":"N Bedon","year":"2010","unstructured":"Bedon, N., B\u00e8s, A., Carton, O., Rispal, C.: Logic and rational languages of words indexed by linear orderings. Theory Comput. Syst. 46(4), 737\u2013760 (2010)","journal-title":"Theory Comput. Syst."},{"issue":"22","key":"20_CR4","doi-asserted-by":"publisher","first-page":"2356","DOI":"10.1016\/j.tcs.2011.01.016","volume":"412","author":"N Bedon","year":"2011","unstructured":"Bedon, N., Rispal, C.: Series-parallel languages on scattered and countable posets. Theor. Comput. Sci. 412(22), 2356\u20132369 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2006.10.009","volume":"73","author":"V Bruy\u00e8re","year":"2007","unstructured":"Bruy\u00e8re, V., Carton, O.: Automata on linear orderings. J. Comput. Syst. Sci. 73(1), 1\u201324 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR6","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. Zeit. Math. Logik. Grund. Math. 6, 66\u201392 (1960)","journal-title":"Zeit. Math. Logik. Grund. Math."},{"key":"20_CR7","unstructured":"B\u00fcchi, J.R.: On a decision method in the restricted second-order arithmetic. In: 1960 Proceedings of the International Congress on Logic, Methodology and Philosophy of Science, Berkeley, pp. 1\u201311. Stanford University Press (1962)"},{"key":"20_CR8","unstructured":"B\u00fcchi, J.R.: Transfinite automata recursions and weak second order theory of ordinals. In: 1964 Proceedings of the International Congress Logic, Methodology, and Philosophy of Science, pp. 2\u201323. North Holland Publishing Company (1965)"},{"issue":"2","key":"20_CR9","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0021-8693(69)90070-2","volume":"13","author":"S Eilenberg","year":"1969","unstructured":"Eilenberg, S., Sch\u00fctzenberger, M.P.: Rational sets in commutative monoids. J. Algebra 13(2), 173\u2013191 (1969)","journal-title":"J. Algebra"},{"key":"20_CR10","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, 21\u201351 (1961)","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pac. J. Math. 16(2), 285\u2013296 (1966)","journal-title":"Pac. J. Math."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Automata Studies, pp. 3\u201341. Princeton University Press (1956)","DOI":"10.1515\/9781400882618-002"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(02)00370-5","volume":"299","author":"D Kuske","year":"2003","unstructured":"Kuske, D.: Towards a language theory for infinite N-free pomsets. Theor. Comput. Sci. 299, 347\u2013386 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-540-49382-2_33","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"K Lodaya","year":"1998","unstructured":"Lodaya, K., Weil, P.: A Kleene iteration for parallelism. In: Arvind, V., Ramanujam, S. (eds.) FSTTCS 1998. LNCS, vol. 1530, pp. 355\u2013366. Springer, Heidelberg (1998). \n                      https:\/\/doi.org\/10.1007\/978-3-540-49382-2_33"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BFb0028590","volume-title":"STACS 98","author":"K Lodaya","year":"1998","unstructured":"Lodaya, K., Weil, P.: Series-parallel posets: algebra, automata and languages. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol. 1373, pp. 555\u2013565. Springer, Heidelberg (1998). \n                      https:\/\/doi.org\/10.1007\/BFb0028590"},{"issue":"1\u20132","key":"20_CR16","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(00)00031-1","volume":"237","author":"K Lodaya","year":"2000","unstructured":"Lodaya, K., Weil, P.: Series-parallel languages and the bounded-width property. Theor. Comput. Sci. 237(1\u20132), 347\u2013380 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1006\/inco.2001.3077","volume":"171","author":"K Lodaya","year":"2001","unstructured":"Lodaya, K., Weil, P.: Rationality in algebras with a series operation. Inf. Comput. 171, 269\u2013293 (2001)","journal-title":"Inf. Comput."},{"key":"20_CR18","first-page":"1","volume":"141","author":"MO Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Am. Math. Soc. 141, 1\u20135 (1969)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"20_CR19","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1090\/S0002-9939-1983-0715851-3","volume":"89","author":"I Rival","year":"1983","unstructured":"Rival, I.: Optimal linear extension by interchanging chains. Proc. AMS 89(3), 387\u2013394 (1983)","journal-title":"Proc. AMS"},{"key":"20_CR20","volume-title":"Linear Orderings","author":"JG Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear Orderings. Academic Press, Cambridge (1982)"},{"key":"20_CR21","first-page":"101","volume":"3","author":"BA Trakhtenbrot","year":"1962","unstructured":"Trakhtenbrot, B.A.: Finite automata and monadic second order logic. Siberian Math. 3, 101\u2013131 (1962). (Russian). Translation AMS Transl. 59 23\u201355 (1966)","journal-title":"Siberian Math."},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11, 298\u2013313 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-13435-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:47:40Z","timestamp":1558478860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-13435-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030134341","9783030134358"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-13435-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lata2019.irdta.eu\/","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"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"98","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"32% - 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"}},{"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"}},{"value":"6-7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}