{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:12:07Z","timestamp":1725516727292},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705826"},{"type":"electronic","value":"9783540705833"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70583-3_18","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"209-220","source":"Crossref","is-referenced-by-count":2,"title":["When Does Partial Commutative Closure Preserve Regularity?"],"prefix":"10.1007","author":[{"given":"Antonio Cano","family":"G\u00f3mez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanna","family":"Guaiana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-\u00c9ric","family":"Pin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"18_CR1","first-page":"79","volume":"34","author":"A. Achache","year":"2004","unstructured":"Achache, A.: Op\u00e9rateurs de fermeture semi-commutatifs. Novi Sad J. Math.\u00a034(1), 79\u201387 (2004)","journal-title":"Novi Sad J. Math."},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/LICS.2001.932515","volume-title":"Proc. 16th Symp. on Logic in Computer Science (LICS 2001)","author":"A. Bouajjani","year":"2001","unstructured":"Bouajjani, A., Muscholl, A., Touili, T.: Permutation Rewriting and Algorithmic Verification. In: Proc. 16th Symp. on Logic in Computer Science (LICS 2001), Boston (MA), USA, pp. 399\u2013409. IEEE Pub., Los Alamitos (2001)"},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ic.2005.11.007","volume":"205","author":"A. Bouajjani","year":"2007","unstructured":"Bouajjani, A., Muscholl, A., Touili, T.: Permutation Rewriting and Algorithmic Verification. Information and Computation\u00a0205(2), 199\u2013224 (2007)","journal-title":"Information and Computation"},{"issue":"2-3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-3975(85)90162-8","volume":"40","author":"W. Bucher","year":"1985","unstructured":"Bucher, W., Ehrenfeucht, A., Haussler, D.: On total regulators generated by derivation relations. Theor. Comput. Sci.\u00a040(2-3), 131\u2013148 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-45007-6_4","volume-title":"Developments in Language Theory","author":"A. Cano G\u00f3mez","year":"2003","unstructured":"Cano G\u00f3mez, A., Pin, J.-E.: On a conjecture of Schnoebelen. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 35\u201354. Springer, Heidelberg (2003)"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.tcs.2003.10.034","volume":"312","author":"A. Cano G\u00f3mez","year":"2004","unstructured":"Cano G\u00f3mez, A., Pin, J.-\u00c9.: Shuffle on positive varieties of languages. Theoret. Comput. Sci.\u00a0312, 433\u2013461 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1051\/ita:2007029","volume":"42","author":"G. C\u00e9c\u00e9","year":"2008","unstructured":"C\u00e9c\u00e9, G., H\u00e9am, P.-C., Mainier, Y.: Efficiency of Automata in Semi-Commutation Verification Techniques. Theoret. Informatics Appl.\u00a042, 197\u2013215 (2008)","journal-title":"Theoret. Informatics Appl."},{"key":"18_CR8","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59849-4","volume-title":"Finiteness and regularity in semigroups and formal languages","author":"A. Luca De","year":"1999","unstructured":"De Luca, A., Varricchio, S.: Finiteness and regularity in semigroups and formal languages. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin (1999)"},{"key":"18_CR9","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: Handbook of formal languages. Beyond words, vol.\u00a03, pp. 457\u2013533. Springer, New York (1997)"},{"volume-title":"The book of traces","year":"1995","key":"18_CR10","unstructured":"Diekert, V., Rozenberg, G. (eds.): The book of traces. World Scientific Publishing Co. Inc., River Edge (1995)"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.2307\/2036087","volume":"17","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Bounded regular sets. Proc. Amer. Math. Soc.\u00a017, 1043\u20131049 (1966)","journal-title":"Proc. Amer. Math. Soc."},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pacific J. Math.\u00a016, 285\u2013296 (1966)","journal-title":"Pacific J. Math."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(85)90059-3","volume":"41","author":"P. Gohon","year":"1985","unstructured":"Gohon, P.: An algorithm to decide whether a rational subset of \n                      \n                        \n                      \n                      ${\\mathbb N}^k$\n                     is recognizable. Theor. Comput. Sci.\u00a041, 51\u201359 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR14","first-page":"54","volume-title":"Proc. of the Workshop Trace theory and code parallelization","author":"G. Guaiana","year":"2000","unstructured":"Guaiana, G., Restivo, A., Salemi, S.: On the product of trace languages. In: Bertoni, S.C.R.A., Goldwurm, M. (eds.) Proc. of the Workshop Trace theory and code parallelization, pp. 54\u201367. University of Milan, Italy (2000)"},{"issue":"1","key":"18_CR15","first-page":"61","volume":"9","author":"G. Guaiana","year":"2004","unstructured":"Guaiana, G., Restivo, A., Salemi, S.: On the trace product and some families of languages closed under partial commutations. J. Autom. Lang. Comb.\u00a09(1), 61\u201379 (2004)","journal-title":"J. Autom. Lang. Comb."},{"issue":"2","key":"18_CR16","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0020-0190(95)00187-5","volume":"57","author":"A. Muscholl","year":"1996","unstructured":"Muscholl, A., Petersen, H.: A note on the commutative closure of star-free languages. Inform. Process. Lett.\u00a057(2), 71\u201374 (1996)","journal-title":"Inform. Process. Lett."},{"key":"18_CR17","first-page":"227","volume-title":"Automata and formal languages","author":"E. Ochma\u0144ski","year":"2005","unstructured":"Ochma\u0144ski, E., Stawikowska, K.: On closures of lexicographic star-free languages. In: Automata and formal languages, pp. 227\u2013234. Univ. Szeged. Inst. Inform., Szeged (2005)"},{"issue":"1-3","key":"18_CR18","first-page":"323","volume":"72","author":"E. Ochma\u0144ski","year":"2006","unstructured":"Ochma\u0144ski, E., Stawikowska, K.: Star-free star and trace languages. Fund. Inform.\u00a072(1-3), 323\u2013331 (2006)","journal-title":"Fund. Inform."},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-73208-2_32","volume-title":"Developments in Language Theory","author":"E. Ochma\u0144ski","year":"2007","unstructured":"Ochma\u0144ski, E., Stawikowska, K.: A Star Operation for Star-Free Trace Languages. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 337\u2013345. Springer, Heidelberg (2007)"},{"key":"18_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of formal languages","author":"J.-E. Pin","year":"1986","unstructured":"Pin, J.-E.: Varieties of formal languages. North Oxford, London (1986); (Traduction de Vari\u00e9t\u00e9s de langages formels)"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(96)00120-X","volume":"169","author":"J.-E. Pin","year":"1996","unstructured":"Pin, J.-E.: Polynomial closure of group languages and open sets of the Hall topology. Theoret. Comput. Sci.\u00a0169, 185\u2013200 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/BFb0023848","volume-title":"LATIN \u201992","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.\u00a0583, pp. 460\u2013473. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:16:36Z","timestamp":1558278996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705826","9783540705833"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}