{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T12:59:21Z","timestamp":1768568361577,"version":"3.49.0"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319948119","type":"print"},{"value":"9783319948126","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94812-6_13","type":"book-chapter","created":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T22:12:26Z","timestamp":1530223946000},"page":"146-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms and Training for Weighted Multiset Automata and Regular Expressions"],"prefix":"10.1007","author":[{"given":"Justin","family":"DeBenedetto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Chiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1080\/03081089008818006","volume":"27","author":"J Barr\u00eda","year":"1990","unstructured":"Barr\u00eda, J., Halmos, P.R.: Vector bases for two commuting matrices. Linear and Multilinear Algebra 27, 147\u2013157 (1990)","journal-title":"Linear and Multilinear Algebra"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(86)90088-5","volume":"48","author":"G Berry","year":"1986","unstructured":"Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theor. Comput. Sci. 48, 117\u2013126 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1162\/COLI_a_00309","volume":"44","author":"D Chiang","year":"2018","unstructured":"Chiang, D., Drewes, F., Lopez, A., Satta, G.: Weighted DAG automata for semantic graphs. Comput. Linguist. 44, 119\u2013186 (2018)","journal-title":"Comput. Linguist."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/inco.1999.2799","volume":"153","author":"M Droste","year":"1999","unstructured":"Droste, M., Gastin, P.: The Kleene-Sch\u00fctzenberger theorem for formal power series in partially commuting variables. Inf. Comput. 153, 47\u201380 (1999)","journal-title":"Inf. Comput."},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"324","DOI":"10.2307\/1970336","volume":"73","author":"M Gerstenhaber","year":"1961","unstructured":"Gerstenhaber, M.: On dominance and varieties of commuting matrices. Ann. Math. 73(2), 324\u2013348 (1961)","journal-title":"Ann. Math."},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1137\/1004057","volume":"4","author":"F Harary","year":"1962","unstructured":"Harary, F.: The determinant of the adjacency matrix of a graph. SIAM Rev. 4(3), 202\u2013210 (1962)","journal-title":"SIAM Rev."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.laa.2014.10.009","volume":"466","author":"J Holbrook","year":"2015","unstructured":"Holbrook, J., O\u2019Meara, K.C.: Some thoughts on Gerstenhaber\u2019s theorem. Linear Algebra Appl. 466, 267\u2013295 (2015)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"DB Johnson","year":"1975","unstructured":"Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM J. Comput. 4(1), 77\u201384 (1975)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"RE Ladner","year":"1980","unstructured":"Ladner, R.E., Fischer, M.J.: Parallel prefix computation. J. ACM (JACM) 27(4), 831\u2013838 (1980)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"13_CR10","first-page":"211","volume":"66","author":"DE Rutherford","year":"1964","unstructured":"Rutherford, D.E.: The Cayley-Hamilton theorem for semi-rings. Proc. Roy. Soc. Edinb. 66(4), 211\u2013215 (1964)","journal-title":"Proc. Roy. Soc. Edinb."},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02579210","volume":"7","author":"C Thomassen","year":"1987","unstructured":"Thomassen, C.: On digraphs with no two disjoint directed cycles. Combinatorica 7(1), 145\u2013150 (1987)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94812-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:53:47Z","timestamp":1709826827000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94812-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319948119","9783319948126"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94812-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Charlottetown, PE","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.smcs.upei.ca\/ciaa2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}