{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:50:44Z","timestamp":1725663044816},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167617"},{"type":"electronic","value":"9783540398592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16761-7_58","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:50:48Z","timestamp":1330195848000},"page":"89-94","source":"Crossref","is-referenced-by-count":0,"title":["Finite biprefix sets of paths in a Graph"],"prefix":"10.1007","author":[{"given":"Clelia","family":"Felice","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"10_CR1","unstructured":"J. Berstel, D. Perrin, The theory of Codes, Academic Press, 1985"},{"key":"10_CR2","unstructured":"J. Berstel, C. Reutenauer, Rational Series and Their Languages, Springer-Verlag, to appear"},{"issue":"3","key":"10_CR3","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01706090","volume":"6","author":"Y. C\u00e9sari","year":"1972","unstructured":"Y. C\u00e9sari (1972), Sur un algorithme donnant les codes bipr\u00e9fixes finis, Math. Syst. Theory 6 (3), 221\u2013225","journal-title":"Math. Syst. Theory"},{"key":"10_CR4","unstructured":"Y. C\u00e9sari (1979), Propri\u00e9t\u00e9s combinatoires des codes bipr\u00e9fixes complets finis: in D. Perrin, ed., Actes de la 7\u00e8me Ecole de Printemps d' Informatique Th\u00e9orique (Jougne, 1979) 29\u201346"},{"key":"10_CR5","volume-title":"Semigroups and Combinatorial Applications","author":"G. Lallement","year":"1979","unstructured":"G. Lallement, Semigroups and Combinatorial Applications, J. Wiley and Sons, New York, 1979"},{"key":"10_CR6","first-page":"329","volume":"28","author":"P. D","year":"1984","unstructured":"D. Perrin (1984), Completing biprefix codes, Theor. Comp. Science 28, 329\u2013336","journal-title":"Theor. Comp. Science"},{"key":"10_CR7","unstructured":"C. Reutenauer (1981), Int\u00e9gration des codes bipr\u00e9fixes (d'apr\u00e8s C\u00e9sari), Seminaire d'Informatique Th\u00e9orique LITP (1981\u20131982) 67\u201381"},{"key":"10_CR8","unstructured":"C. Reutenauer, Ensembles libres de chemins dans un graphe, to appear"},{"key":"10_CR9","unstructured":"B. Tilson, Semigroupoids, to appear"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1214\/aoms\/1177704860","volume":"32","author":"M.P. Sch\u00fctzenberger","year":"1961","unstructured":"M.P. Sch\u00fctzenberger (1961), On a special class of recurrent events, Ann. Math. Stat. 32, 1201\u20131213.","journal-title":"Ann. Math. Stat."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16761-7_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:05:08Z","timestamp":1619557508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16761-7_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167617","9783540398592"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-16761-7_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}