{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:17:07Z","timestamp":1725466627223},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316524"},{"type":"electronic","value":"9783642316531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31653-1_15","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T09:51:39Z","timestamp":1342259499000},"page":"154-165","source":"Crossref","is-referenced-by-count":0,"title":["Homomorphisms Preserving Deterministic Context-Free Languages"],"prefix":"10.1007","author":[{"given":"Tommi","family":"Lehtinen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Autebert, J., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Rozenberg, Salomaa (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 111\u2013174. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_3"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press (2010)","DOI":"10.1017\/CBO9781139195768"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(91)90260-9","volume":"84","author":"V. Bruy\u00e8re","year":"1991","unstructured":"Bruy\u00e8re, V.: Maximal codes with bounded deciphering delay. Theoretical Computer Science\u00a084(1), 53\u201376 (1991)","journal-title":"Theoretical Computer Science"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/S0049-237X(08)72023-8","volume-title":"Computer Programming and Formal Systems","author":"N. Chomsky","year":"1963","unstructured":"Chomsky, N., Sch\u00fctzenberger, M.P.: The algebraic theory of context-free languages. In: Braffort, Hirschberg (eds.) Computer Programming and Formal Systems, pp. 118\u2013161. North-Holland, Amsterdam (1963)"},{"issue":"6","key":"15_CR5","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/S0019-9958(66)80019-0","volume":"9","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Greibach, S.A.: Deterministic context-free languages. Information and Control\u00a09(6), 620\u2013648 (1966)","journal-title":"Information and Control"},{"issue":"3","key":"15_CR6","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/321341.321345","volume":"13","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Ullian, J.: Preservation of unambiguity and inherent ambiguity in context-free languages. Journal of the ACM\u00a013(3), 364\u2013368 (1966)","journal-title":"Journal of the ACM"},{"issue":"5","key":"15_CR7","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1142\/S0129054110007568","volume":"21","author":"T. Lehtinen","year":"2010","unstructured":"Lehtinen, T., Okhotin, A.: Boolean grammars and gsm mappings. International Journal of Foundations of Computer Science\u00a021(5), 799\u2013815 (2010)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"15_CR8","unstructured":"Lothaire, M.: Combinatorics on Words. Addison-Wesley (1983)"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1051\/ita:2004004","volume":"38","author":"A. Okhotin","year":"2004","unstructured":"Okhotin, A.: On the equivalence of linear conjunctive grammars to trellis automata. RAIRO Informatique Th\u00e9orique et Applications\u00a038(1), 69\u201388 (2004)","journal-title":"RAIRO Informatique Th\u00e9orique et Applications"},{"issue":"3-4","key":"15_CR10","first-page":"299","volume":"13","author":"A. Okhotin","year":"2008","unstructured":"Okhotin, A.: Homomorphisms preserving linear conjunctive languages. Journal of Automata, Languages and Combinatorics\u00a013(3-4), 299\u2013305 (2008)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(75)90015-8","volume":"1","author":"A. Restivo","year":"1975","unstructured":"Restivo, A.: A combinatorial property of codes having finite synchronization delay. Theoretical Computer Science\u00a01(2), 95\u2013101 (1975)","journal-title":"Theoretical Computer Science"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/S0019-9958(70)90446-8","volume":"17","author":"D.J. Rosenkrantz","year":"1970","unstructured":"Rosenkrantz, D.J., Stearns, R.E.: Properties of deterministic top-down grammars. Information and Control\u00a017, 226\u2013256 (1970)","journal-title":"Information and Control"},{"issue":"4","key":"15_CR13","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/S0021-9800(66)80015-7","volume":"1","author":"M.P. Sch\u00fctzenberger","year":"1966","unstructured":"Sch\u00fctzenberger, M.P.: On a question concerning certain free submonoids. Journal of Combinatorial Theory\u00a01(4), 437\u2013442 (1966)","journal-title":"Journal of Combinatorial Theory"},{"issue":"4","key":"15_CR14","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1051\/ita\/1986200404831","volume":"20","author":"L. Staiger","year":"1986","unstructured":"Staiger, L.: On infinitary finite length codes. RAIRO Informatique Th\u00e9orique et Applications\u00a020(4), 483\u2013494 (1986)","journal-title":"RAIRO Informatique Th\u00e9orique et Applications"},{"issue":"4","key":"15_CR15","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1093\/comjnl\/14.4.396","volume":"14","author":"D. Wood","year":"1971","unstructured":"Wood, D.: A further note on top-down deterministic languages. Computer Journal\u00a014(4), 396\u2013403 (1971)","journal-title":"Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31653-1_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:41:27Z","timestamp":1620128487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31653-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316524","9783642316531"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31653-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}