{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:15Z","timestamp":1725489315960},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540745099"},{"type":"electronic","value":"9783540745105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74510-5_19","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T11:11:35Z","timestamp":1187694695000},"page":"168-181","source":"Crossref","is-referenced-by-count":4,"title":["Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth"],"prefix":"10.1007","author":[{"given":"Artur","family":"Je\u017c","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M. Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theoretical Computer Science\u00a047, 149\u2013158 (1986)","journal-title":"Theoretical Computer Science"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Culik II, K., Gruska, J., Salomaa, A.: Systolic trellis automata, I and II. International Journal of Computer Mathematics\u00a015, 195\u2013212 (1984), 16, 3\u201322 (1984)","DOI":"10.1080\/00207168408803421"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/S0020-0190(02)00316-2","volume":"84","author":"M. Domaratzki","year":"2002","unstructured":"Domaratzki, M., Pighizzini, G., Shallit, J.: Simulating finite automata with context-free grammars. Information Processing Letters\u00a084, 339\u2013344 (2002)","journal-title":"Information Processing Letters"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/321127.321132","volume":"9","author":"S. Ginsburg","year":"1962","unstructured":"Ginsburg, S., Rice, H.G.: Two families of languages related to ALGOL. Journal of the ACM\u00a09, 350\u2013371 (1962)","journal-title":"Journal of the ACM"},{"key":"19_CR5","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1090\/psapm\/019\/0235938","volume":"19","author":"J. Hartmanis","year":"1967","unstructured":"Hartmanis, J.: Context-free languages and Turing machine computations. Proceedings of Symposia in Applied Mathematics\u00a019, 42\u201351 (1967)","journal-title":"Proceedings of Symposia in Applied Mathematics"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0304-3975(84)90015-X","volume":"29","author":"O.H. Ibarra","year":"1984","unstructured":"Ibarra, O.H., Kim, S.M.: Characterizations and computational complexity of systolic trellis automata. Theoretical Computer Science\u00a029, 123\u2013153 (1984)","journal-title":"Theoretical Computer Science"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Je\u017c, A.: Conjunctive grammars can generate non-regular unary languages. In: DLT 2007, Turku, Finland, July 3\u20136, 2007 (to appear)","DOI":"10.1007\/978-3-540-73208-2_24"},{"key":"19_CR8","unstructured":"Je\u017c, A., Okhotin, A.: Language equations with addition in positional notation, TUCS Technical Report No 824, Turku Centre for Computer Science, Turku, Finland (June 2007)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(94)90227-5","volume":"132","author":"E.L. Leiss","year":"1994","unstructured":"Leiss, E.L.: Unrestricted complementation in language equations over a one-letter alphabet. Theoretical Computer Science\u00a0132, 71\u201393 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"19_CR10","first-page":"519","volume":"6","author":"A. Okhotin","year":"2001","unstructured":"Okhotin, A.: Conjunctive grammars. Journal of Automata, Languages and Combinatorics\u00a06(4), 519\u2013535 (2001)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1023\/A:1020213411126","volume":"28","author":"A. Okhotin","year":"2002","unstructured":"Okhotin, A.: Conjunctive grammars and systems of language equations. Programming and Computer Software\u00a028, 243\u2013249 (2002)","journal-title":"Programming and Computer Software"},{"issue":"1","key":"19_CR12","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. Informatique Th\u00e9orique et Applications\u00a038(1), 69\u201388 (2004)","journal-title":"Informatique Th\u00e9orique et Applications"},{"key":"19_CR13","first-page":"96","volume":"91","author":"A. Okhotin","year":"2007","unstructured":"Okhotin, A.: Nine open problems for conjunctive and Boolean grammars. Bulletin of the EATCS\u00a091, 96\u2013119 (2007)","journal-title":"Bulletin of the EATCS"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/11779148_38","volume-title":"Developments in Language Theory","author":"A. Okhotin","year":"2006","unstructured":"Okhotin, A., Yakimova, O.: On language equations with complementation. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 420\u2013432. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74510-5_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:22:50Z","timestamp":1605745370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74510-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540745099","9783540745105"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74510-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}