{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:10:48Z","timestamp":1725905448684},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319628080"},{"type":"electronic","value":"9783319628097"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62809-7_18","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T08:37:57Z","timestamp":1500539877000},"page":"247-259","source":"Crossref","is-referenced-by-count":0,"title":["The Generalized Rank of Trace Languages"],"prefix":"10.1007","author":[{"given":"Michal","family":"Kunc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Meitner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"key":"18_CR1","volume-title":"Noncommutative Rational Series with Applications","author":"J Berstel","year":"2011","unstructured":"Berstel, J., Reutenauer, C.: Noncommutative Rational Series with Applications. Cambridge University Press, Cambridge (2011)"},{"key":"18_CR2","series-title":"Beyond Words","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/978-3-642-59126-6_8","volume-title":"Handbook of Formal Languages","author":"V Diekert","year":"1997","unstructured":"Diekert, V., M\u00e9tivier, Y.: Partial commutation and traces. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Beyond Words, vol. 3, pp. 457\u2013533. Springer, Berlin (1997)"},{"issue":"6","key":"18_CR3","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1017\/S0960129501003395","volume":"11","author":"M Droste","year":"2001","unstructured":"Droste, M., Kuske, D.: Recognizable languages in divisibility monoids. Math. Struct. Comput. Sci. 11(6), 743\u2013770 (2001)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"18_CR4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0304-3975(91)90019-X","volume":"86","author":"K Hashiguchi","year":"1991","unstructured":"Hashiguchi, K.: Recognizable closures and submonoids of free partially commutative monoids. Theoret. Comput. Sci. 86(2), 233\u2013241 (1991)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"18_CR5","first-page":"93","volume":"67","author":"B Klunder","year":"2005","unstructured":"Klunder, B., Ochma\u0144ski, E., Stawikowska, K.: On star-connected flat languages. Fund. Inform. 67(1\u20133), 93\u2013105 (2005)","journal-title":"Fund. Inform."},{"key":"18_CR6","unstructured":"Leung, H.: An algebraic method for solving decision problems in finite automata theory. Ph.D. thesis, Pennsylvania State University (1987)"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/3-540-56939-1_93","volume-title":"Automata, Languages and Programming","author":"E Ochma\u0144ski","year":"1993","unstructured":"Ochma\u0144ski, E., Wacrenier, P.-A.: On regular compatibility of semi-commutations. In: Lingas, A., Karlsson, R., Carlsson, S. (eds.) ICALP 1993. LNCS, vol. 700, pp. 445\u2013456. Springer, Heidelberg (1993). doi:\n10.1007\/3-540-56939-1_93"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/BFb0023848","volume-title":"1st Latin American symposium on theoretical informatics, LATIN 1992","author":"J Sakarovitch","year":"1992","unstructured":"Sakarovitch, J.: The \u201clast\u201d decision problem for rational trace languages. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 460\u2013473. Springer, Berlin (1992)"},{"key":"18_CR9","unstructured":"Simon, I.: The nondeterministic complexity of a finite automaton. In: Lothaire, M. (ed.) Mots, M\u00e9langes offerts \u00e0 M.-P. Sch\u00fctzenberger, pp. 384\u2013400. Herm\u00e8s, Paris (1990)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62809-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T08:42:09Z","timestamp":1500540129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62809-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319628080","9783319628097"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62809-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}