{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:04:31Z","timestamp":1757624671435,"version":"3.44.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032014740"},{"type":"electronic","value":"9783032014757"}],"license":[{"start":{"date-parts":[[2025,8,17]],"date-time":"2025-08-17T00:00:00Z","timestamp":1755388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,17]],"date-time":"2025-08-17T00:00:00Z","timestamp":1755388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-01475-7_7","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T17:39:20Z","timestamp":1755365960000},"page":"92-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Positive Varieties of\u00a0Lattice Languages"],"prefix":"10.1007","author":[{"given":"Yusuke","family":"Inoue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuji","family":"Komatsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"issue":"5","key":"7_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1080\/00029890.1986.11971821","volume":"93","author":"D Aldous","year":"1986","unstructured":"Aldous, D., Diaconis, P.: Shuffling cards and stopping times. Am. Math. Mon. 93(5), 333\u2013348 (1986)","journal-title":"Am. Math. Mon."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.jcss.2023.03.005","volume":"136","author":"C Baier","year":"2023","unstructured":"Baier, C., Kiefer, S., Klein, J., M\u00fcller, D., Worrell, J.: Markov chains and unambiguous automata. J. Comput. Syst. Sci. 136, 113\u2013134 (2023)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Ballester-Bolinches, A., Pin, J.E., Soler-Escriv\u00e0, X.: Formations of finite monoids and formal languages: Eilenberg\u2019s variety theorem revisited. Forum Mathematicum, 26(6):1737\u20131761, (2014)","DOI":"10.1515\/forum-2012-0055"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Bruns, G., Godefroid, P.: Model checking with multi-valued logics. In: International Colloquium on Automata, Languages, and Programming, pages 281\u2013293. Springer, (2004)","DOI":"10.1007\/978-3-540-27836-8_26"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF00535487","volume":"57","author":"P Diaconis","year":"1981","unstructured":"Diaconis, P., Shahshahani, M.: Generating a random permutation with random transpositions. Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und Verwandte Gebiete 57(2), 159\u2013179 (1981). https:\/\/doi.org\/10.1007\/BF00535487","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und Verwandte Gebiete"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of weighted Automata. Springer Science and Business Media, (2009)","DOI":"10.1007\/978-3-642-01492-5"},{"key":"7_CR7","unstructured":"Eilenberg, S.: Automata, languages, and machines. Academic press, (1974)"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462153.1462154","volume":"56","author":"K Etessami","year":"2009","unstructured":"Etessami, K., Yannakakis, M.: Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. J. ACM (JACM) 56(1), 1\u201366 (2009)","journal-title":"J. ACM (JACM)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Inoue, Y., Hashimoto, K., Seki, H.: Semidirect product decompositions for periodic regular languages. In: International Conference on Developments in Language Theory, pages 173\u2013188. Springer, (2024)","DOI":"10.1007\/978-3-031-66159-4_13"},{"key":"7_CR10","unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Van Nostrand, (1960)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Lustig, Y., Lattice automata. In: International Workshop on Verification, Model Checking, and Abstract Interpretation, pages 199\u2013213. Springer, (2007)","DOI":"10.1007\/978-3-540-69738-1_14"},{"key":"7_CR12","unstructured":"Pin, J.: A variety theorem without complementation. Russian Mathematics (Izvestija vuzov. Matematika), 39:80\u201390, (1995)"},{"key":"7_CR13","first-page":"73","volume":"7","author":"J\u00c9 Pin","year":"2010","unstructured":"Pin, J.\u00c9.: Mathematical foundations of automata theory. Lect. Notes LIAFA, Universit\u00e9 Paris 7, 73 (2010)","journal-title":"Lect. Notes LIAFA, Universit\u00e9 Paris"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Pol\u00e1k, L.: Syntactic semiring of a language. In: International Symposium on Mathematical Foundations of Computer Science, pages 611\u2013620. Springer, (2001)","DOI":"10.1007\/3-540-44683-4_53"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1016\/j.aim.2019.03.004","volume":"347","author":"J Rhodes","year":"2019","unstructured":"Rhodes, J., Schilling, A.: Unified theory for finite Markov chains. Adv. Math. 347, 739\u2013779 (2019)","journal-title":"Adv. Math."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Saloff-Coste, L.: Random walks on finite groups. In: Probability on Discrete Structures, pages 263\u2013346. Springer, (2004)","DOI":"10.1007\/978-3-662-09444-0_5"},{"key":"7_CR17","unstructured":"Salomaa, A., Soittola, M.: Automata-theoretic aspects of formal power series. Springer Science and Business Media, (2012)"},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"Marcel Paul Sch\u00fctzenberger","year":"1965","unstructured":"Marcel Paul Sch\u00fctzenberger: On finite monoids having only trivial subgroups. Inf. Control 8(2), 190\u2013194 (1965)","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01475-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T15:13:56Z","timestamp":1757430836000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01475-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,17]]},"ISBN":["9783032014740","9783032014757"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01475-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,17]]},"assertion":[{"value":"17 August 2025","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":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cida.uos.ac.kr\/dlt2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}