{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T04:04:31Z","timestamp":1649045071795},"reference-count":13,"publisher":"EDP Sciences","license":[{"start":{"date-parts":[[2021,4,20]],"date-time":"2021-04-20T00:00:00Z","timestamp":1618876800000},"content-version":"vor","delay-in-days":109,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"accepted":{"date-parts":[[2021,3,19]]},"published-print":{"date-parts":[[2021]]},"abstract":"<jats:p>We investigate the open problem to characterize whether the infinite power of a given language is generated by an <jats:italic>\u03c9<\/jats:italic>-code. In case the given language is a code (<jats:italic>i.e.<\/jats:italic> zero-relation language), the problem was solved. In this work, we solve the problem for the class of one-relation languages.<\/jats:p>","DOI":"10.1051\/ita\/2021002","type":"journal-article","created":{"date-parts":[[2021,4,20]],"date-time":"2021-04-20T08:20:37Z","timestamp":1618906837000},"page":"2","source":"Crossref","is-referenced-by-count":0,"title":["One-relation languages and code generators"],"prefix":"10.1051","volume":"55","author":[{"given":"Vinh Duc","family":"Tran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Litovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2021,4,20]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1142\/S0129054107005030","volume":"18","author":"Czeizler","year":"2007","journal-title":"Int. J. Found. Computer Sci."},{"key":"R2","first-page":"241","volume":"11","author":"Devolder","year":"1994","journal-title":"Acta Cybern."},{"key":"R3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0022-4049(98)00019-X","volume":"141","author":"Guzm\u00e1n","year":"1999","journal-title":"J. Pure Appl. Algebra"},{"key":"R4","unstructured":"Julia S., \nOn \u03c9-generators and codes. In 23d ICALP (Int. Coll. on Automata, Languages and Programming). Vol. 1099 of Lecture Notes in Computer Sciences. \nSpringer, \nBerlin \n(1996) 393\u2013402."},{"key":"R5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-0190(96)00136-6","volume":"60","author":"Julia","year":"1996","journal-title":"Inf. Process. Lett"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Julia S. and \nDuc T.V., \nFamilies and \u03c9-ambiguity removal. \nIn In Proc. 7th Int. Conf. on Words (WORDS), Salerno \n(2009).","DOI":"10.12968\/sece.2009.3.1451"},{"key":"R7","unstructured":"Litovsky I., \nG\u00e9n\u00e9rateurs des langages rationnels de mots infinis. \nPh.D. thesis, Universit\u00e9 de Lille\n(1988)."},{"key":"R8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(91)90134-4","volume":"37","author":"Litovsky","year":"1991","journal-title":"Inf. Process. Lett"},{"key":"R9","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(87)90063-6","volume":"53","author":"Litovsky","year":"1987","journal-title":"Theor. Comput. Sci"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Lothaire M., \nAlgebraic Combinatorics on Words. \nCambridge University Press \n(2002).","DOI":"10.1017\/CBO9781107326019"},{"key":"R11","unstructured":"Nivat M., \nInfinitary Relations. In \nCAAP \u201981: Proceedings of the 6th Colloquium on Trees in Algebra and Programming. \nSpringer \n(1981) 46\u201375."},{"key":"R12","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1051\/ita\/1986200404831","volume":"20","author":"Staiger","year":"1986","journal-title":"Theor. Inf. Appl"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Wrathall C., Confluence of One-Rule Thue Systems. Word Equations and Related Topics. Vol. 572 of \nLecture Notes in Computer Sciences. \nSpringer \n(1992) 237\u2013246.","DOI":"10.1007\/3-540-55124-7_11"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2021002\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,20]],"date-time":"2021-04-20T08:21:08Z","timestamp":1618906868000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2021002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":13,"alternative-id":["ita200021"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2021002","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}