{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T11:17:15Z","timestamp":1675941435337},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s00224-009-9230-6","type":"journal-article","created":{"date-parts":[[2009,7,31]],"date-time":"2009-07-31T14:54:53Z","timestamp":1249052093000},"page":"479-498","source":"Crossref","is-referenced-by-count":2,"title":["A Search Algorithm for Subshift Attractors of Cellular Automata"],"prefix":"10.1007","volume":"46","author":[{"given":"Enrico","family":"Formenti","sequence":"first","affiliation":[]},{"given":"Petr","family":"K\u016frka","sequence":"additional","affiliation":[]},{"given":"Ond\u0159ej","family":"Zahradn\u00edk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,1]]},"reference":[{"key":"9230_CR1","first-page":"524","volume":"2005","author":"P. K\u016frka","year":"2005","unstructured":"K\u016frka, P.: On the measure attractor of a cellular automaton. Discrete Continuous Dyn. Syst. 2005, 524\u2013535 (2005) Supplement volume","journal-title":"Discrete Continuous Dyn. Syst."},{"key":"9230_CR2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1088\/0951-7715\/20\/1\/007","volume":"20","author":"E. Formenti","year":"2007","unstructured":"Formenti, E., K\u016frka, P.: Subshift attractors of cellular automata. Nonlinearity 20, 105\u2013117 (2007)","journal-title":"Nonlinearity"},{"issue":"4","key":"9230_CR3","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1137\/0218057","volume":"18","author":"K. Culik","year":"1989","unstructured":"Culik, K., Pachl, J., Yu, S.: On the limit set of cellular automata. SIAM J. Comput. 18(4), 831\u2013842 (1989)","journal-title":"SIAM J. Comput."},{"key":"9230_CR4","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1017\/S0143385700008609","volume":"15","author":"A. Maass","year":"1995","unstructured":"Maass, A.: On the sofic limit set of cellular automata. Ergod. Theory Dyn. Syst. 15, 663\u2013684 (1995)","journal-title":"Ergod. Theory Dyn. Syst."},{"issue":"3","key":"9230_CR5","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1137\/0221036","volume":"21","author":"J. Kari","year":"1992","unstructured":"Kari, J.: The nilpotency problem of one-dimensional cellular automata. SIAM J. Comput. 21(3), 571\u2013586 (1992)","journal-title":"SIAM J. Comput."},{"key":"9230_CR6","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/978-3-540-70918-3_31","volume-title":"STACS 2007","author":"E. Formenti","year":"2007","unstructured":"Formenti, E., K\u016frka, P.: A search algorithm for the maximal attractor of a cellular automaton. In: Thomas, W., Weil, P. (eds.) STACS 2007, vol.\u00a04393, pp.\u00a0356\u2013366. Springer, Berlin (2007)"},{"issue":"4","key":"9230_CR7","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1016\/S0019-3577(00)87901-X","volume":"10","author":"M. Boyle","year":"1999","unstructured":"Boyle, M., Kitchens, B.: Periodic points for onto cellular automata. Indag. Math. 10(4), 483\u2013493 (1999)","journal-title":"Indag. Math."},{"key":"9230_CR8","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullmann, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"9230_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511626302","volume-title":"An Introduction to Symbolic Dynamics and Coding","author":"D. Lind","year":"1995","unstructured":"Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)"},{"key":"9230_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58822-8","volume-title":"Symbolic Dynamics","author":"B.P. Kitchens","year":"1998","unstructured":"Kitchens, B.P.: Symbolic Dynamics. Springer, Berlin (1998)"},{"key":"9230_CR11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0304-3975(94)90041-8","volume":"127","author":"J. Kari","year":"1994","unstructured":"Kari, J.: The Rice\u2019s theorem for the limit sets of cellular automata. Theor. Comput. Sci. 127, 229\u2013254 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"9230_CR12","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear search algorithms. SIAM J. Comput. 1, 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"9230_CR13","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/S0304-3975(99)00150-4","volume":"250","author":"T. Knuutila","year":"2001","unstructured":"Knuutila, T.: Re-describing an algorithm by Hopcroft. Theor. Comput. Sci. 250, 333\u2013363 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"9230_CR14","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1137\/0222067","volume":"22","author":"T. Jiang","year":"1993","unstructured":"Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Comput. 22(6), 1117\u20131141 (1993)","journal-title":"SIAM J. Comput."},{"key":"9230_CR15","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/S0304-3975(03)00311-6","volume":"306","author":"L. Ilie","year":"2003","unstructured":"Ilie, L., Yu, S.: Reducing NFAs by invariant equivalences. Theor. Comput. Sci. 306, 373\u2013390 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"9230_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/11496656_27","volume-title":"Proceedings of the 16th CPM","author":"L. Ilie","year":"2005","unstructured":"Ilie, L., Solis-Oba, R., Yu, S.: Reducing NFAs by equivalences and preorders. In: Apostolico, A., Crochemore, M., Park, K. (eds.) Proceedings of the 16th CPM, Jeju Island, Korea, 2005. Lecture Notes in Computer Science, vol.\u00a03537, pp.\u00a0310\u2013321. Springer, Berlin (2005)"},{"key":"9230_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/978-3-540-27812-2_11","volume-title":"Theory Is Forever (Salomaa Festschrift)","author":"L. Ilie","year":"2004","unstructured":"Ilie, L., Navarro, G., Yu, S.: On NFA reductions. In: Karhumaki, J. (ed.) Theory Is Forever (Salomaa Festschrift). Lecture Notes in Computer Science, vol.\u00a03113, pp.\u00a0112\u2013124. Springer, Berlin (2004)"},{"issue":"3","key":"9230_CR18","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.tcs.2004.02.048","volume":"327","author":"J.M. Champarnaud","year":"2004","unstructured":"Champarnaud, J.M., Coulon, F.: NFA reduction algorithms by means of regular inequalities. Theor. Comput. Sci. 327(3), 241\u2013253 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"9230_CR19","doi-asserted-by":"crossref","unstructured":"Champarnaud, J.M., Coulon, F.: NFA reduction algorithms by means of regular inequalities\u2014correction. Erratum in Theor. Comput. Sci. (2005)","DOI":"10.1016\/j.tcs.2004.02.048"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9230-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-009-9230-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9230-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:38Z","timestamp":1558698698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-009-9230-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,1]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["9230"],"URL":"https:\/\/doi.org\/10.1007\/s00224-009-9230-6","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,1]]}}}