{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:37Z","timestamp":1725558937530},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540252610"},{"type":"electronic","value":"9783540318347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31834-7_24","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T18:23:40Z","timestamp":1278095020000},"page":"292-303","source":"Crossref","is-referenced-by-count":2,"title":["On Computational Universality in Language Equations"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-642-59136-5_3","volume-title":"Handbook of Formal Languages","author":"J. Autebert","year":"1997","unstructured":"Autebert, J., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Rozenberg, S. (ed.) Handbook of Formal Languages, vol.\u00a01, pp. 111\u2013174. Springer, Berlin (1997)"},{"key":"24_CR2","unstructured":"Baader, F., K\u00fcsters, R.: Solving linear equations over regular languages. In: Proceedings of the 15th International Workshop on Unification (UNIF 2001), Siena, Italy, June 18-19, pp. 27\u201331 (2001)"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","volume":"8","author":"B.S. Baker","year":"1974","unstructured":"Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. Journal of Computer and System Sciences\u00a08, 315\u2013332 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1080\/00207168408803410","volume":"15","author":"K. Culik II","year":"1984","unstructured":"Culik II, K., Gruska, J., Salomaa, A.: Systolic trellis automata, I and II. International Journal of Computer Mathematics\u00a015, 195\u2013212 (1984)","journal-title":"International Journal of Computer Mathematics"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0304-3975(02)00656-4","volume":"296","author":"H. Fernau","year":"2003","unstructured":"Fernau, H.: Nonterminal complexity of programmed grammars. Theoretical Computer Science\u00a0296, 225\u2013251 (2003)","journal-title":"Theoretical Computer Science"},{"key":"24_CR6","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"},{"issue":"3","key":"24_CR7","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1006\/jcss.1996.0082","volume":"53","author":"L. Kari","year":"1996","unstructured":"Kari, L., Thierrin, G.: Maximal and minimal solutions to language equations. Journal of Computer and System Sciences\u00a053(3), 487\u2013496 (1996)","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/S0304-3975(01)00389-9","volume":"289","author":"J. Karhum\u00e4ki","year":"2002","unstructured":"Karhum\u00e4ki, J., Petre, I.: Conway\u2019s problem for three-word sets. Theoretical Computer Science\u00a0289, 705\u2013725 (2002)","journal-title":"Theoretical Computer Science"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-46011-X_27","volume-title":"Developments in Language Theory","author":"M. Kudlek","year":"2002","unstructured":"Kudlek, M., Rogozhin, Y.: A Universal Turing Machine with 3 States and 9 Symbols. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol.\u00a02295, pp. 311\u2013318. Springer, Heidelberg (2002)"},{"key":"24_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-2156-2","volume-title":"Language equations","author":"E.L. Leiss","year":"1999","unstructured":"Leiss, E.L.: Language equations. Springer, New York (1999)"},{"issue":"4","key":"24_CR11","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"},{"issue":"5","key":"24_CR12","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(5), 243\u2013249 (2002)","journal-title":"Programming and Computer Software"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-45061-0_21","volume-title":"Automata, Languages and Programming","author":"A. Okhotin","year":"2003","unstructured":"Okhotin, A.: Decision problems for language equations with Boolean operations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 239\u2013251. Springer, Heidelberg (2003)"},{"key":"24_CR14","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, 69\u201388 (2004)","journal-title":"Informatique Th\u00e9orique et Applications"},{"issue":"2-3","key":"24_CR15","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.tcs.2004.03.002","volume":"320","author":"A. Okhotin","year":"2004","unstructured":"Okhotin, A.: On the number of nonterminals in linear conjunctive grammars. Theoretical Computer Science\u00a0320(2-3), 419\u2013448 (2004)","journal-title":"Theoretical Computer Science"},{"key":"24_CR16","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr","year":"1967","unstructured":"Rogers Jr, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)"},{"key":"24_CR17","volume-title":"Theory of Automata","author":"A. Salomaa","year":"1969","unstructured":"Salomaa, A.: Theory of Automata. Pergamon Press, Oxford (1969)"},{"key":"24_CR18","unstructured":"Yevtushenko, N., Villa, T., Brayton, R.K., Petrenko, A., Sangiovanni- Vincentelli, A.L.: Solution of parallel language equations for logic synthesis. In: Proceedings of ICCAD 2001, San Jose, CA, USA, November 4-8, 2001, pp. 103\u2013110 (2001)"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1051\/ita:2003023","volume":"37","author":"G.-Q. Zhang","year":"2003","unstructured":"Zhang, G.-Q.: Domain mu-calculus. Informatique Th\u00e9orique et Applications\u00a037, 337\u2013364 (2003)","journal-title":"Informatique Th\u00e9orique et Applications"}],"container-title":["Lecture Notes in Computer Science","Machines, Computations, and Universality"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31834-7_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:41:37Z","timestamp":1620013297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31834-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540252610","9783540318347"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31834-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}