{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:50Z","timestamp":1759637690651},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223412"},{"type":"electronic","value":"9783540278016"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27801-6_11","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:00:15Z","timestamp":1283727615000},"page":"145-158","source":"Crossref","is-referenced-by-count":8,"title":["A Trie-Based Approach for Compacting Automata"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chiara","family":"Epifanio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filippo","family":"Mignosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"11_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"V. Aho","year":"1975","unstructured":"Aho, V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Comm. ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Comm. ACM"},{"key":"11_CR2","unstructured":"B\u00e9al, M.-P.: Codage Symbolique, Masson (1993)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"STACS 96","author":"M.-P. B\u00e9al","year":"1996","unstructured":"B\u00e9al, M.-P., Mignosi, F., Restivo, A.: Minimal Forbidden Words and Symbolic Dynamics. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, Springer, Heidelberg (1996)"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A. Blumer","year":"1985","unstructured":"Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.: The Smallest Automaton Recognizing the Subwords of a Text. Theoretical Computer Science\u00a040(1), 31\u201355 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(01)00222-5","volume":"292","author":"M. Crochemore","year":"2003","unstructured":"Crochemore, M.: Reducing space for index implementation. Theoretical Computer Science\u00a0292(1), 185\u2013197 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0020-0190(98)00104-5","volume":"67","author":"M. Crochemore","year":"1998","unstructured":"Crochemore, M., Mignosi, F., Restivo, A.: Automata and forbidden words. Information Processing Letters\u00a067(3), 111\u2013117 (1998)","journal-title":"Information Processing Letters"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Mignosi, F., Restivo, A., Salemi, S.: Data compression using antidictonaries. In: Storer, J. (ed.) Special issue Lossless data, compressionProceedings of the IEEE, vol.88 pp. 1756\u20131768 (2000)","DOI":"10.1109\/5.892711"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/3-540-63220-4_55","volume-title":"Combinatorial Pattern Matching","author":"M. Crochemore","year":"1997","unstructured":"Crochemore, M., V\u00e9rin, R.: Direct Construction of Compact Directed Acyclic Word Graphs. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol.1264, pp. 116\u2013129. Springer, Heidelberg (1997)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","first-page":"555","volume-title":"STACS 96","author":"V. Diekert","year":"1996","unstructured":"Diekert, V., Kobayashi, Y.: Some identities related to automata, determinants, and M\u00f6bius functions, Report 1997\/05, Fakult\u00e4t Informatik, Universit\u00e4t Stuttgart. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.1046, pp. 555\u2013566. Springer, Heidelberg (1996)"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.ipl.2003.09.013","volume":"89","author":"B.K. Durgan","year":"2004","unstructured":"Durgan, B.K.: Compact searchable static binary trees. Information Processing Letters\u00a089, 49\u201352 (2004)","journal-title":"Information Processing Letters"},{"key":"11_CR11","unstructured":"Holub, J.: Personal Communication (1999)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-44977-9_31","volume-title":"Implementation and Application of Automata","author":"J. Holub","year":"2003","unstructured":"Holub, J., Crochemore, M.: On the implementation of compact dAWG\u2019s. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol.\u00a02608, pp. 289\u2013294. Springer, Heidelberg (2003)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S., Mauri, G., Pavesi, G.: On-Line Construction of Compact Directed Acyclic Word Graphs .To appear in Discrete Applied Mathematics (special issue for (CPM 2001) (2001)","DOI":"10.1109\/SPIRE.2001.989743"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-48194-X_16","volume-title":"Combinatorial Pattern Matching","author":"S. Inenaga","year":"2001","unstructured":"Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S., Mauri, G., Pavesi, G.: On-line construction of compact directed acyclic word graphs. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 169\u2013180. Springer, Heidelberg (2001)"},{"key":"11_CR15","volume-title":"Encyclopedia of Mathematics and its Applications","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. In: Encyclopedia of Mathematics and its Applications, vol. 90, Cambridge University Press, Cambridge (2002)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27801-6_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:25Z","timestamp":1605759685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27801-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223412","9783540278016"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27801-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}