{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:51:56Z","timestamp":1743144716446,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030485153"},{"type":"electronic","value":"9783030485160"}],"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-48516-0_1","type":"book-chapter","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T23:04:30Z","timestamp":1590447870000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Equational Theories of Scattered and\u00a0Countable Series-Parallel Posets"],"prefix":"10.1007","author":[{"given":"Amrane","family":"Amazigh","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":[[2020,5,26]]},"reference":[{"key":"1_CR1","series-title":"Series in Algebra","volume-title":"Finite Semigroups and Universal Algebra","author":"J Almeida","year":"1994","unstructured":"Almeida, J.: Finite Semigroups and Universal Algebra. Series in Algebra, vol. 3. World Scientific, Singapore (1994)"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/j.tcs.2020.01.015","volume":"809","author":"A Amrane","year":"2020","unstructured":"Amrane, A., Bedon, N.: Logic and rational languages of scattered and countable series-parallel posets. Theor. Comput. Sci. 809, 538\u2013562 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.01.015 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397520300426","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218196798000028","volume":"8","author":"N Bedon","year":"1998","unstructured":"Bedon, N.: Automata, semigroups and recognizability of words on ordinals. Int. J. Algebra Comput. 8(1), 1\u201321 (1998)","journal-title":"Int. J. Algebra Comput."},{"issue":"25","key":"1_CR4","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). https:\/\/doi.org\/10.1142\/S0129054118420042","journal-title":"Int. J. Found. Comput. Sci."},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BFb0054310","volume-title":"LATIN\u201998: Theoretical Informatics","author":"N Bedon","year":"1998","unstructured":"Bedon, N., Carton, O.: An Eilenberg theorem for words on countable ordinals. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 53\u201364. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054310"},{"issue":"22","key":"1_CR6","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\u20132","key":"1_CR7","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0304-3975(00)00040-2","volume":"259","author":"S Bloom","year":"2001","unstructured":"Bloom, S., Choffrut, C.: Long words: the theory of concatenation and $$\\omega $$-power. Theor. Comput. Sci. 259(1\u20132), 533\u2013548 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"4\u20136","key":"1_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1051\/ita\/1998324-601751","volume":"32","author":"S Bloom","year":"1998","unstructured":"Bloom, S., \u00c9sik, Z.: Shuffle binoids. RAIRO-Theor. Inform. Appl. 32(4\u20136), 175\u2013198 (1998)","journal-title":"RAIRO-Theor. Inform. Appl."},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1051\/ita:2004005","volume":"38","author":"S Bloom","year":"2004","unstructured":"Bloom, S., \u00c9sik, Z.: Axiomatizing omega and omega-op powers of words. RAIRO-Theor. Inform. Appl. 38(1), 3\u201317 (2004)","journal-title":"RAIRO-Theor. Inform. Appl."},{"key":"1_CR10","unstructured":"Carton, O., Colcombet, T., Puppis, G.: Regular languages of words over countable linear orderings. CoRR abs\/1702.05342 (2017). http:\/\/arxiv.org\/abs\/1702.05342"},{"issue":"4","key":"1_CR11","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1142\/S0129054105003285","volume":"16","author":"O Carton","year":"2005","unstructured":"Carton, O., Rispal, C.: Complementation of rational sets on countable scattered linear orderings. Int. J. Found. Comput. Sci. 16(4), 767\u2013786 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.tcs.2018.04.010","volume":"737","author":"C Choffrut","year":"2018","unstructured":"Choffrut, C., \u00c9sik, Z.: Two equational theories of partial words. Theor. Comput. Sci. 737, 19\u201339 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"18","key":"1_CR13","doi-asserted-by":"publisher","first-page":"1704","DOI":"10.1016\/j.tcs.2008.12.052","volume":"410","author":"M Fiore","year":"2009","unstructured":"Fiore, M., Hur, C.K.: On the construction of free algebras for equational systems. Theor. Comput. Sci. 410(18), 1704\u20131729 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2008.12.052 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397508009353 . Automata, Languages and Programming (ICALP 2007)","journal-title":"Theor. Comput. Sci."},{"issue":"2\u20133","key":"1_CR14","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","volume":"61","author":"J Gischer","year":"1988","unstructured":"Gischer, J.: The equational theory of pomsets. Theor. Comput. Sci. 61(2\u20133), 199\u2013224 (1988)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1_CR15","doi-asserted-by":"crossref","first-page":"427","DOI":"10.3233\/FI-1981-4210","volume":"4","author":"J Grabowski","year":"1981","unstructured":"Grabowski, J.: On partial languages. Fundam. Inform. 4(1), 427\u2013498 (1981)","journal-title":"Fundam. Inform."},{"issue":"4","key":"1_CR16","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BF01451165","volume":"65","author":"F Hausdorff","year":"1908","unstructured":"Hausdorff, F.: Grundz\u00fcge einer theorie der geordneten mengen. Mathematische Annalen 65(4), 435\u2013505 (1908)","journal-title":"Mathematische Annalen"},{"key":"1_CR17","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."},{"issue":"3","key":"1_CR18","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"},{"issue":"3\u20135","key":"1_CR19","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/s001650200014","volume":"13","author":"E Robinson","year":"2002","unstructured":"Robinson, E.: Variations on algebra: monadicity and generalisations of equational theories. Formal Aspects Comput. 13(3\u20135), 308\u2013326 (2002). https:\/\/doi.org\/10.1007\/s001650200014","journal-title":"Formal Aspects Comput."},{"key":"1_CR20","volume-title":"Linear Orderings","author":"JG Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear Orderings. Academic Press, Cambridge (1982)"},{"key":"1_CR21","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."},{"issue":"4","key":"1_CR22","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1142\/S0218196793000287","volume":"3","author":"T Wilke","year":"1993","unstructured":"Wilke, T.: An algebraic theory for regular languages of finite and infinite words. Int. J. Algebra Comput. 3(4), 447\u2013489 (1993)","journal-title":"Int. J. Algebra Comput."},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/3-540-09526-8_53","volume-title":"Mathematical Foundations of Computer Science 1979","author":"J Winkowski","year":"1979","unstructured":"Winkowski, J.: An algebraic approach to concurrence. In: Be\u010dv\u00e1\u0159, J. (ed.) MFCS 1979. LNCS, vol. 74, pp. 523\u2013532. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09526-8_53"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48516-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,24]],"date-time":"2022-10-24T21:30:33Z","timestamp":1666647033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-48516-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030485153","9783030485160"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48516-0_1","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":"26 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tampa, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"11 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/knot.math.usf.edu\/dlt2020\/","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":"38","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":"24","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":"63% - 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.7","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":"1.48","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":"Conference cancelled 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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}