{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:32:45Z","timestamp":1726407165962},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403913"},{"type":"electronic","value":"9783540449775"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44977-9_6","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T14:20:28Z","timestamp":1192544428000},"page":"67-76","source":"Crossref","is-referenced-by-count":0,"title":["The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata"],"prefix":"10.1007","author":[{"given":"Cezar","family":"C\u0103mpeanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"P\u0103un","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"6_CR1","first-page":"32","volume":"267","author":"C. C\u00e2mpeanu","year":"2001","unstructured":"C. C\u00e2mpeanu, N. S\u00e2ntean and S. Yu, \u201cMinimal Cover-Automata for Finite Languages\u201d, Proceedings of the Third International Workshop on Implementing Automata WIA\u201998 (1998), 32\u201342 and TCS vol 267 (2001), 3-16.","journal-title":"Minimal Cover-Automata for Finite Languages"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1137\/0219069","volume":"19","author":"C. Dwork","year":"1990","unstructured":"C. Dwork and L. Stockmeyer, \u201cA Time Complexity Gap for Two-Way Probabilistic Finite-State Automata\u201d, SIAM Journal on Computing, vol.19 (1990), 1011\u20131023.","journal-title":"SIAM Journal on Computing"},{"key":"6_CR3","unstructured":"J. E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation Addison-Wesley, (1979)."},{"key":"6_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-54233-7_133","volume-title":"ICALP\u201991","author":"J. Kaneps","year":"1991","unstructured":"J. Kaneps, R. Frievalds, \u201cRunning Time to Recognize Non-Regular Languages by 2-Way Probabilistic Automata\u201d, in ICALP\u201991, LNCS, Springer-Verlag, New-York\/Berlin (1991) vol 510, 174\u2013185."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"A. P\u0103un, N. S\u00e2ntean and Sheng Yu, \u201cAn O(n 2) algorithm for Minimal Cover-Automata for Finite Languages\u201d, Proceedings of the 5th International Conference on Implementation and Application of Automata CIAA\u201900 (2000), 243\u2013251.","DOI":"10.1007\/3-540-44674-5_20"},{"key":"6_CR6","unstructured":"N. S\u00e2ntean, Towards a Minimal Representation for Finite Languages: Theory and Practice, MSc Thesis, Department of Computer Science, The University of Western Ontario, (2000)."},{"key":"6_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-48057-9","volume-title":"Automata Implementation","author":"J. M. Champarnaud","year":"1999","unstructured":"J. M. Champarnaud and D. Maurel, Automata Implementation, Proceedings of Third International Workshop on Implementing Automata, LNCS 1660, Springer, (1999)."},{"key":"6_CR8","unstructured":"A. Salomaa, Formal Languages Academic Press, (1973)."},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"S. Yu, \u201cRegular languages\u201d, in Handbook of Formal Languages, Vol I, eds. G. Rozenberg and A. Salomaa, Springer-Verlag, (1997), 41\u2013110.","DOI":"10.1007\/978-3-642-59136-5_2"},{"key":"6_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0031375","volume-title":"Automata Implementation","author":"D. Wood","year":"1998","unstructured":"D. Wood and S. Yu, Automata Implementation, Proceedings of Second International Workshop on Implementing Automata, LNCS 1436, Springer, (1998)."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44977-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T20:23:24Z","timestamp":1556915004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}