{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:56:47Z","timestamp":1725530207342},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642009815"},{"type":"electronic","value":"9783642009822"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00982-2_21","type":"book-chapter","created":{"date-parts":[[2009,3,30]],"date-time":"2009-03-30T19:51:54Z","timestamp":1238442714000},"page":"247-258","source":"Crossref","is-referenced-by-count":5,"title":["Decision Problems for Convex Languages"],"prefix":"10.1007","author":[{"given":"Janusz","family":"Brzozowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","first-page":"481","volume-title":"Automata, Languages, and Programming","author":"G. Thierrin","year":"1973","unstructured":"Thierrin, G.: Convex languages. In: Nivat, M. (ed.) Automata, Languages, and Programming, pp. 481\u2013492. North-Holland, Amsterdam (1973)"},{"key":"21_CR2","unstructured":"Ang, T., Brzozowski, J.: Continuous languages. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) Proc. 12th International Conference on Automata and Formal Languages, pp. 74\u201385. Computer and Automation Research Institute, Hungarian Academy of Sciences (2008)"},{"key":"21_CR3","volume-title":"Theory of Codes","author":"J. Berstel","year":"1985","unstructured":"Berstel, J., Perrin, D.: Theory of Codes. Academic Press, New York (1985)"},{"key":"21_CR4","unstructured":"Han, Y.S.: Decision algorithms for subfamilies of regular languages using state-pair graphs. Bull. European Assoc. Theor. Comput. Sci.\u00a0(93), 118\u2013133 (2007)"},{"key":"21_CR5","unstructured":"Brzozowski, J.A., Shallit, J., Xu, Z.: Decision problems for convex languages (preprint, 2008), \n                    \n                      http:\/\/arxiv.org\/abs\/0808.1928"},{"key":"21_CR6","first-page":"121","volume":"56","author":"M.P. B\u00e9al","year":"2003","unstructured":"B\u00e9al, M.P., Crochemore, M., Mignosi, F., Restivo, A., Sciortino, M.: Computing forbidden words of regular languages. Fund. Inform.\u00a056, 121\u2013135 (2003)","journal-title":"Fund. Inform."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-1-4612-3352-7_20","volume-title":"Sequences","author":"A. Luca de","year":"1990","unstructured":"de Luca, A., Varricchio, S.: Some combinatorial properties of factorial languages. In: Capocelli, R. (ed.) Sequences, pp. 258\u2013266. Springer, Heidelberg (1990)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1142\/S0129054106003887","volume":"17","author":"Y.S. Han","year":"2006","unstructured":"Han, Y.S., Wang, Y., Wood, D.: Infix-free regular expressions and languages. Internat. J. Found. Comp. Sci.\u00a017, 379\u2013393 (2006)","journal-title":"Internat. J. Found. Comp. Sci."},{"key":"21_CR9","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/0207007","volume":"7","author":"H.B. Hunt III","year":"1978","unstructured":"Hunt III, H.B., Rosenkrantz, D.J.: Computational parallels between the regular and context-free languages. SIAM J. Comput.\u00a07, 99\u2013114 (1978)","journal-title":"SIAM J. Comput."},{"key":"21_CR11","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-642-59136-5_8","volume-title":"Handbook of Formal Languages","author":"H. J\u00fcrgensen","year":"1997","unstructured":"J\u00fcrgensen, H., Konstantinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 511\u2013607. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00982-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T07:17:52Z","timestamp":1551943072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00982-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642009815","9783642009822"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00982-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}