{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:10Z","timestamp":1725493450436},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540763352"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76336-9_6","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T05:44:48Z","timestamp":1193463888000},"page":"38-50","source":"Crossref","is-referenced-by-count":0,"title":["Reducing Acyclic Cover Transducers"],"prefix":"10.1007","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":"Jacques","family":"Farr\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44674-5_20","volume-title":"Implementation and Application of Automata","author":"A. P\u0103un","year":"2001","unstructured":"P\u0103un, A., S\u00e2ntean, N., Yu, S.: An O(n 2) algorithm for constructing minimal cover automata for finite languages. In: Yu, S., P\u0103un, A. (eds.) CIAA 2000. LNCS, vol.\u00a02088, pp. 243\u2013251. Springer, Heidelberg (2001)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1142\/S0129054102000960","volume":"13","author":"C. C\u00e2mpeanu","year":"2002","unstructured":"C\u00e2mpeanu, C., P\u0103un, A., Yu, S.: An efficient algorithm for constructing minimal cover automata for finite languages. Int. J. Found. Comput. Sci.\u00a013, 83\u201397 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-54233-7_133","volume-title":"Automata, Languages and Programming","author":"J. Kaneps","year":"1991","unstructured":"Kaneps, J., Freivalds, R.: Running time to recognize nonregular languages by 2-way probabilistic automata. In: Leach Albert, J., Monien, B., Rodr\u00edguez-Artalejo, M. (eds.) Automata, Languages and Programming. LNCS, vol.\u00a0510, pp. 174\u2013185. Springer, Heidelberg (1991)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1137\/0219069","volume":"19","author":"C. Dwork","year":"1990","unstructured":"Dwork, C., Stockmeyer, L.: A time complexity gap for two-way probabilistic finite-state automata. SIAMJC\u00a019, 1011\u20131023 (1990)","journal-title":"SIAMJC"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1051\/ita:2005006","volume":"39","author":"J.M. Champarnaud","year":"2005","unstructured":"Champarnaud, J.M., Guingne, F., Hansel, G.: Similarity relations and cover automata. RAIRO Theoret. Informatics Appl.\u00a039, 115\u2013123 (2005)","journal-title":"RAIRO Theoret. Informatics Appl."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00292-9","volume":"267","author":"C. C\u00e2mpeanu","year":"2001","unstructured":"C\u00e2mpeanu, C., S\u00e2ntean, N., Yu, S.: Minimal cover-automata for finite languages. Theor. Comput. Sci.\u00a0267, 3\u201316 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1142\/S0129054103002187","volume":"14","author":"H. K\u00f6rner","year":"2003","unstructured":"K\u00f6rner, H.: A time and space efficient algorithm for minimizing cover automata for finite languages. Int. J. Found. Comput. Sci.\u00a014, 1071\u20131086 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1142\/S0129054105003339","volume":"16","author":"J.M. Champarnaud","year":"2005","unstructured":"Champarnaud, J.M., Guingne, F., Hansel, G.: Cover transducers for functions with finite domain. Int. J. Found. Comput. Sci.\u00a016, 851\u2013865 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0304-3975(77)90055-X","volume":"4","author":"M.P. Sch\u00fctzenberger","year":"1977","unstructured":"Sch\u00fctzenberger, M.P.: Sur une variante des fonctions s\u00e9quentielles. Theor. Comput. Sci.\u00a04, 47\u201357 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR10","unstructured":"Choffrut, C.: Contribution \u00e0 l\u2019\u00e9tude de quelques familles remarquables de fonctions rationnelles. Th\u00e8se d\u2019\u00c9tat, Universit\u00e9 Paris 7, Math\u00e9matiques (1978)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. vol. 38 of Leitf\u00e4den der angewandten Mathematik und Mechanik LAMM. Teubner (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(01)00219-5","volume":"292","author":"C. Choffrut","year":"2003","unstructured":"Choffrut, C.: Minimizing subsequential transducers: a survey. Theor. Comput. Sci.\u00a0292, 131\u2013143 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1051\/ita:2000127","volume":"34","author":"M.P. B\u00e9al","year":"2000","unstructured":"B\u00e9al, M.P., Carton, O.: Computing the prefix of an automaton. RAIRO Theoret. Informatics Appl.\u00a034, 503\u2013514 (2000)","journal-title":"RAIRO Theoret. Informatics Appl."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(98)00115-7","volume":"234","author":"M. Mohri","year":"2000","unstructured":"Mohri, M.: Minimization algorithms for sequential transducers. Theor. Comput. Sci.\u00a0234, 177\u2013201 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR15","volume-title":"Data Structures and Algorithms","author":"A.V. Aho","year":"1983","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley, Reading (1983)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput.\u00a016, 973\u2013989 (1987)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76336-9_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:48:16Z","timestamp":1619520496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76336-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540763352"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76336-9_6","relation":{},"subject":[]}}