{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:30Z","timestamp":1725491430300},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372134"},{"type":"electronic","value":"9783540372141"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11812128_4","type":"book-chapter","created":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T09:32:31Z","timestamp":1155115951000},"page":"23-33","source":"Crossref","is-referenced-by-count":1,"title":["Path-Equivalent Removals of \u03b5-transitions in a Genomic Weighted Finite Automaton"],"prefix":"10.1007","author":[{"given":"Mathieu","family":"Giraud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Veber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Lavenier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-30500-2_14","volume-title":"Implementation and Application of Automata","author":"M. Giraud","year":"2005","unstructured":"Giraud, M., Lavenier, D.: Linear encoding scheme for weighted finite automata. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 146\u2013155. Springer, Heidelberg (2005)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Giraud, M., Lavenier, D.: Dealing with hardware space limits when removing epsilon-transitions in a genomic weighted finite automaton. Journal of Automata, Languages and Combinatorics\u00a010 (2005)","DOI":"10.1007\/11812128_4"},{"key":"4_CR3","volume-title":"Compilers, Principles, Techniques and Tools","author":"A.V. Aho","year":"1986","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers, Principles, Techniques and Tools. Addison Wesley, Reading (1986)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K. Thompson","year":"1968","unstructured":"Thompson, K.: Regular expression search algorithm. Communications of the ACM\u00a011, 419\u2013422 (1968)","journal-title":"Communications of the ACM"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1142\/S0129054102000996","volume":"13","author":"M. Mohri","year":"2002","unstructured":"Mohri, M.: Generic epsilon-removal and input epsilon-normalization algorithms for weighted transducers. International Journal of Foundations of Computer Science\u00a013, 129\u2013143 (2002)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"4_CR6","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: Finite-State Transducers in Language and Speech Processing. Computational Linguistics\u00a023, 269\u2013311 (1997)","journal-title":"Computational Linguistics"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Quignon, P., Giraud, M., Rimbault, M., Lavigne, P., Tacher, S., Morin, E., Retout, E., Valin, A.S., Lindblad-Toh, K., Nicolas, J., Galibert, F.: The dog and rat olfactory receptor repertoires. Genome Biology\u00a06, R83 (2005)","DOI":"10.1186\/gb-2005-6-10-r83"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BFb0023448","volume-title":"STACS 97","author":"J. Hromkovic","year":"1997","unstructured":"Hromkovic, J., Seibert, S., Wilke, T.: Translating regular expressions into small epsilon-free nondeterministic finite automata. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol.\u00a01200, pp. 55\u201366. Springer, Heidelberg (1997)"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0020-0190(02)00436-2","volume":"85","author":"Y. Lifshits","year":"2003","unstructured":"Lifshits, Y.: A lower bound on the size of \u03b5-free NFA corresponding to a regular expression. Information Processing Letters\u00a085, 293\u2013299 (2003)","journal-title":"Information Processing Letters"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Hagenah, C., Muscholl, A.: Computing \u03b5-free NFA from regular expressions in $\\mathcal{O}{n \\log^2(n)}$ time. Mathematical Foundations of Computer Science, 277\u2013285 (1998)","DOI":"10.1007\/BFb0055777"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/11564096_50","volume-title":"Machine Learning: ECML 2005","author":"F. Coste","year":"2005","unstructured":"Coste, F., Kerbellec, G.: A similar fragments merging approach to learn automata on proteins. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds.) ECML 2005. LNCS, vol.\u00a03720, pp. 522\u2013529. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11812128_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:14:01Z","timestamp":1605644041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11812128_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372134","9783540372141"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11812128_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}