{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T14:11:48Z","timestamp":1676470308004},"reference-count":8,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1051\/ita:2005006","type":"journal-article","created":{"date-parts":[[2005,2,22]],"date-time":"2005-02-22T10:43:04Z","timestamp":1109068984000},"page":"115-123","source":"Crossref","is-referenced-by-count":7,"title":["Similarity relations and cover automata"],"prefix":"10.1051","volume":"39","author":[{"given":"Jean-Marc","family":"Champarnaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franck","family":"Guingne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georges","family":"Hansel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2005,3,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(00)00292-9","volume":"267","author":"C\u00e2mpeanu","year":"2001","journal-title":"Theor. Comput. Sci."},{"key":"R2","first-page":"99","volume":"13-1","author":"C\u00e2mpeanu","year":"2002","journal-title":"Int. J. Foundations Comput. Sci."},{"key":"R3","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1137\/0219069","volume":"19","author":"Dwork","year":"1990","journal-title":"SIAM J. Comput."},{"key":"R4","unstructured":"J.E. Hopcroft and J.D. Ullman,Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading MA (1979)."},{"key":"R5","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-54233-7_133","volume":"510","author":"Kaneps","year":"1991","journal-title":"Lect. Notes Comput. Sci."},{"key":"R6","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1142\/S0129054103002187","volume":"14","author":"K\u00f6rner","year":"2003","journal-title":"Int. J. Foundations Comput. Sci."},{"key":"R7","unstructured":"N. S\u00e2ntean,Towards a Minimal Representation for Finite Languages: Theory and Practice. Master Thesis, The University of Western Ontario (2000)."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"S. Yu, Regular Languages, inHandbook of Formal Languages, edited by G. Rozenberg and A. Salomaa. Springer, Berlin (1997).","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2005006\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:42:52Z","timestamp":1586122972000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2005006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":8,"journal-issue":{"issue":"1"},"alternative-id":["ita0417"],"URL":"https:\/\/doi.org\/10.1051\/ita:2005006","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}