{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T10:58:46Z","timestamp":1780743526153,"version":"3.54.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031095733","type":"print"},{"value":"9783031095740","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09574-0_13","type":"book-chapter","created":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T17:36:07Z","timestamp":1656005767000},"page":"209-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Finite Ambiguity and\u00a0Finite Sequentiality in\u00a0Weighted Automata over\u00a0Fields"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5474-8781","authenticated-orcid":false,"given":"Peter","family":"Kostol\u00e1nyi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,24]]},"reference":[{"issue":"6","key":"13_CR1","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1142\/S0129054103002126","volume":"14","author":"C Allauzen","year":"2003","unstructured":"Allauzen, C., Mohri, M.: Finitely subsequential transducers. Int. J. Found. Comput. Sci. 14(6), 983\u2013994 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-40313-2_10","volume-title":"Mathematical Foundations of Computer Science 2013","author":"S Bala","year":"2013","unstructured":"Bala, S.: Which finitely ambiguous automata recognize finitely sequential functions? In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 86\u201397. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40313-2_10"},{"key":"13_CR3","unstructured":"Barloy, C., Fijalkow, N., Lhote, N., Mazowiecki, F.: A robust class of linear recurrence sequences. In: Computer Science Logic, CSL 2020, pp. 9:1\u20139:16 (2020)"},{"key":"13_CR4","unstructured":"Bell, P.C.: Polynomially ambiguous probabilistic automata on restricted languages. In: Automata, Languages and Programming, ICALP 2019. pp. 105:1\u2013105:14 (2019)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Berstel, J., Reutenauer, C.: Noncommutative Rational Series with Applications. Cambridge University Press, Cambridge (2011)","DOI":"10.1017\/CBO9780511760860"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, A., Mazowiecki, F., Muscholl, A., Riveros, C.: Pumping lemmas for weighted automata. Logical Methods Comput. Sci. 17(3), 7:1\u20137:21 (2021)","DOI":"10.46298\/lmcs-17(3:7)2021"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-662-54458-7_13","volume-title":"Foundations of Software Science and Computation Structures","author":"L Daviaud","year":"2017","unstructured":"Daviaud, L., Jecker, I., Reynier, P.-A., Villevalois, D.: Degree of Sequentiality of weighted automata. In: Esparza, J., Murawski, A.S. (eds.) FoSSaCS 2017. LNCS, vol. 10203, pp. 215\u2013230. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54458-7_13"},{"key":"13_CR8","unstructured":"Droste, M., Gastin, P.: Aperiodic weighted automata and weighted first-order logic. In: Mathematical Foundations of Computer Science, MFCS 2019. pp. 76:1\u201376:15 (2019)"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer-Verlag. Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5","DOI":"10.1007\/978-3-642-01492-5"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Droste, M., Kuske, D.: Weighted automata. In: Pin, J.\u00c9. (ed.) Handbook of Automata Theory, Vol. 1, chap. 4, pp. 113\u2013150. European Mathematical Society (2021)","DOI":"10.4171\/Automata-1\/4"},{"key":"13_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-27602-5","volume-title":"An Introduction to Difference Equations","author":"S Elaydi","year":"2005","unstructured":"Elaydi, S.: An Introduction to Difference Equations, 3rd edn. Springer, New York (2005). https:\/\/doi.org\/10.1007\/0-387-27602-5","edition":"3"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Fijalkow, N., Riveros, C., Worrell, J.: Probabilistic automata of bounded ambiguity. Inf. Comput. 282, 104648 (2022)","DOI":"10.1016\/j.ic.2020.104648"},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1080\/0025570X.1984.11977069","volume":"57","author":"D Kalman","year":"1984","unstructured":"Kalman, D.: The generalized Vandermonde matrix. Math. Mag. 57(1), 15\u201321 (1984)","journal-title":"Math. Mag."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Kirsten, D.: A Burnside approach to the termination of Mohri\u2019s algorithm for polynomially ambiguous min-plus-automata. RAIRO Theoret. Inform. Appl. 42(3), 553\u2013581 (2008)","DOI":"10.1051\/ita:2008017"},{"key":"13_CR15","unstructured":"Kirsten, D., Lombardy, S.: Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata. In: Symposium on Theoretical Aspects of Computer Science, STACS 2009, pp. 589\u2013600 (2009)"},{"issue":"3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.tcs.2004.02.049","volume":"327","author":"I Klimann","year":"2004","unstructured":"Klimann, I., Lombardy, S., Mairesse, J., Prieur, C.: Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton. Theoret. Comput. Sci. 327(3), 349\u2013373 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR17","unstructured":"Kostol\u00e1nyi, P.: Polynomially ambiguous unary weighted automata over fields, submitted"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2018.05.003","volume":"740","author":"P Kostol\u00e1nyi","year":"2018","unstructured":"Kostol\u00e1nyi, P., Mi\u0161\u00fan, F.: Alternating weighted automata over commutative semirings. Theoret. Comput. Sci. 740, 1\u201327 (2018)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.tcs.2006.01.028","volume":"356","author":"S Lombardy","year":"2006","unstructured":"Lombardy, S., Sakarovitch, J.: Sequential? Theoret. Comput. Sci. 356, 224\u2013244 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-030-79121-6_12","volume-title":"Implementation and Application of Automata","author":"A Maletti","year":"2021","unstructured":"Maletti, A., Nasz, T., Stier, K., Ulbricht, M.: Ambiguity hierarchies for weighted tree automata. In: Maneth, S. (ed.) CIAA 2021. LNCS, vol. 12803, pp. 140\u2013151. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79121-6_12"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2018.07.002","volume":"100","author":"F Mazowiecki","year":"2019","unstructured":"Mazowiecki, F., Riveros, C.: Copyless cost-register automata: Structure, expressiveness, and closure properties. J. Comput. Syst. Sci. 100, 1\u201329 (2019)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR22","volume-title":"Nonnegative Matrices","author":"H Minc","year":"1988","unstructured":"Minc, H.: Nonnegative Matrices. Wiley, New York (1988)"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-662-53132-7_30","volume-title":"Developments in Language Theory","author":"E Paul","year":"2016","unstructured":"Paul, E.: On finite and polynomial ambiguity of weighted tree automata. In: Brlek, S., Reutenauer, C. (eds.) DLT 2016. LNCS, vol. 9840, pp. 368\u2013379. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53132-7_30"},{"key":"13_CR24","unstructured":"Paul, E.: Finite sequentiality of unambiguous max-plus tree automata. In: Symposium on Theoretical Aspects of Computer Science, STACS 2019, pp. 55:1\u201355:17 (2019)"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Paul, E.: Finite sequentiality of finitely ambiguous max-plus tree automata. In: Automata, Languages and Programming, ICALP 2020, pp. 137:1\u2013137:15 (2020)","DOI":"10.1007\/s00224-021-10049-6"},{"issue":"4","key":"13_CR26","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/s00224-020-10021-w","volume":"65","author":"E Paul","year":"2021","unstructured":"Paul, E.: Finite sequentiality of unambiguous max-plus tree automata. Theory Comput. Syst. 65(4), 736\u2013776 (2021)","journal-title":"Theory Comput. Syst."},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, New York (2009)","DOI":"10.1017\/CBO9781139195218"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Springer, New York (1978). https:\/\/doi.org\/10.1007\/978-1-4612-6264-0","DOI":"10.1007\/978-1-4612-6264-0"},{"issue":"2\u20133","key":"13_CR29","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"MP Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: On the definition of a family of automata. Inf. Control 4(2\u20133), 245\u2013270 (1961)","journal-title":"Inf. Control"},{"issue":"2","key":"13_CR30","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(91)90381-B","volume":"88","author":"A Weber","year":"1991","unstructured":"Weber, A., Seidl, H.: On the degree of ambiguity of finite automata. Theoret. Comput. Sci. 88(2), 325\u2013349 (1991)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09574-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T23:03:58Z","timestamp":1656284638000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09574-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031095733","9783031095740"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09574-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 June 2022","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":"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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2022","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":"csr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2022\/","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":"51","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":"21","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":"41% - 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)"}}]}}