{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:23Z","timestamp":1725558983719},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_14","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T19:01:42Z","timestamp":1278097302000},"page":"168-176","source":"Crossref","is-referenced-by-count":5,"title":["Minimal de Bruijn Sequence in a Language with Forbidden Substrings"],"prefix":"10.1007","author":[{"given":"Eduardo","family":"Moreno","sequence":"first","affiliation":[]},{"given":"Mart\u00edn","family":"Matamala","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","first-page":"758","volume":"49","author":"N.G. Bruijn de","year":"1946","unstructured":"de Bruijn, N.G.: A combinatorial problem. Nederl. Akad. Wetensch., Proc.\u00a049, 758\u2013764 (1946)","journal-title":"Nederl. Akad. Wetensch., Proc."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1038\/scientificamerican0561-148","volume":"204","author":"S.K. Stein","year":"1961","unstructured":"Stein, S.K.: The mathematician as an explorer. Sci. Amer.\u00a0204, 148\u2013158 (1961)","journal-title":"Sci. Amer."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/(SICI)1097-0037(199710)30:3<205::AID-NET5>3.0.CO;2-P","volume":"30","author":"J.C. Bermond","year":"1997","unstructured":"Bermond, J.C., Dawes, R.W., Ergincan, F.\u00d6.: De Bruijn and Kautz bus networks. Networks\u00a030, 205\u2013218 (1997)","journal-title":"Networks"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0012-365X(92)90699-G","volume":"110","author":"F. Chung","year":"1992","unstructured":"Chung, F., Diaconis, P., Graham, R.: Universal cycles for combinatorial structures. Discrete Math.\u00a0110, 43\u201359 (1992)","journal-title":"Discrete Math"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/1024041","volume":"24","author":"H. Fredricksen","year":"1982","unstructured":"Fredricksen, H.: A survey of full length nonlinear shift register cycle algorithms. SIAM Rev.\u00a024, 195\u2013221 (1982)","journal-title":"SIAM Rev"},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0012-365X(78)90002-X","volume":"23","author":"H. Fredricksen","year":"1978","unstructured":"Fredricksen, H., Maiorana, J.: Necklaces of beads in k colors and k-ary de Bruijn sequences. Discrete Math.\u00a023, 207\u2013210 (1978)","journal-title":"Discrete Math."},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/0196-6774(92)90047-G","volume":"13","author":"F. Ruskey","year":"1992","unstructured":"Ruskey, F., Savage, C., Wang, T.M.: Generating necklaces. J. Algorithms\u00a013, 414\u2013430 (1992)","journal-title":"J. Algorithms"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/3-540-44968-X_33","volume-title":"Computing and Combinatorics","author":"F. Ruskey","year":"2000","unstructured":"Ruskey, F., Sawada, J.: Generating necklaces and strings with forbidden substrings. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol.\u00a01858, pp. 330\u2013339. Springer, Heidelberg (2000)"},{"key":"14_CR9","unstructured":"Moreno, E.: Lyndon words and de bruijn sequences in a subshift of finite type. In: Harju, T., Karhum\u00e4ki, J. (eds.) Proceedings of WORDS 2003. TUCS General Publications, Turku, Finland, vol. 27, pp. 400\u2013410. Turku Centre for Computer Science (2003)"},{"key":"14_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626302","volume-title":"Symbolic Dynamics and Codings","author":"D. Lind","year":"1995","unstructured":"Lind, D., Marcus, B.: Symbolic Dynamics and Codings. Cambridge University Press, Cambridge (1995)"},{"key":"14_CR11","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Graph theory","author":"W.T. Tutte","year":"1984","unstructured":"Tutte, W.T.: Graph theory. Encyclopedia of Mathematics and its Applications, vol.\u00a021. Addison-Wesley Publishing Company Advanced Book Program, Reading (1984)"},{"key":"14_CR12","unstructured":"Matamala, M., Moreno, E.: Minimal Eulerian cycle in a labeled digraph. Technical Report CMM-B-04\/08-108, DIM-CMM, Universidad de Chile (2004)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30559-0_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:29:57Z","timestamp":1620012597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}