{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:50Z","timestamp":1725663770915},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578116"},{"type":"electronic","value":"9783540483373"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57811-0_16","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:24:22Z","timestamp":1330262662000},"page":"192-202","source":"Crossref","is-referenced-by-count":0,"title":["On the complexity of some reachability problems"],"prefix":"10.1007","author":[{"given":"Angelo","family":"Monti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Roncato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"16_CR1","first-page":"53","volume":"18","author":"K. Culik II","year":"1984","unstructured":"K. Culik II, A. Salomaa and D. Wood: Systolic Tree Acceptors. R.A.I.R.O. Inform. Theor. 18, 53\u201369 (1984)","journal-title":"R.A.I.R.O. Inform. Theor."},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF00289573","volume":"18","author":"K. Culik II","year":"1983","unstructured":"K. Culik II, J. Gruska and A. Salomaa: Systolic Automata for VLSI on balanced tree. Acta Informatica 18, 335\u2013344 (1983)","journal-title":"Acta Informatica"},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(83)90032-4","volume":"23","author":"K. Culik II","year":"1983","unstructured":"K. Culik II, J. Gruska and A. Salomaa: On a Family of L languages Resulting from Systolic Tree Automata. Theoret. Comp. Sci. 23, 231\u2013242 (1983)","journal-title":"Theoret. Comp. Sci."},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"571","DOI":"10.3233\/FI-1989-12409","volume":"12","author":"E. Fachini","year":"1989","unstructured":"E. Fachini, A. Maggiolo Schettini, G. Resta and D. Sangiorgio: Some structural properties of systolic tree automata. Fundamenta Informaticae 12, 571\u2013586 (1989)","journal-title":"Fundamenta Informaticae"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0304-3975(91)90277-9","volume":"83","author":"E. Fachini","year":"1991","unstructured":"E. Fachini, A. Maggiolo Schettini, G. Resta and D. Sangiorgio: Nonacceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata. Theoretical Computer Science 83, 249\u2013260 (1991)","journal-title":"Theoretical Computer Science"},{"key":"16_CR6","first-page":"199","volume-title":"Regular sets, context-free languages and Systolic Y-tree Automata","author":"E. Fachini","year":"1992","unstructured":"E. Fachini and A. Monti: Regular sets, context-free languages and Systolic Y-tree Automata. In Proc. of the 4-th Italian conference on Theoretical Computer Science. L'Aquila: World Scientific 1992, pp. 199\u2013213"},{"key":"16_CR7","unstructured":"E. Fachini and A. Monti: A Kleene-like characterization for languages accepted by Systolic Tree Automata. J. of Computer and systems sciences to appear."},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0304-3975(90)90190-S","volume":"71","author":"J. Gruska","year":"1990","unstructured":"J. Gruska: Syntesis, structure and power of systolic computations. Theoretical Computer Science 71, 47\u201377 (1990)","journal-title":"Theoretical Computer Science"},{"key":"16_CR9","volume-title":"Developmental Systems and Languages","author":"G. T. Herman","year":"1975","unstructured":"G. T. Herman and G. Rozenberg: Developmental Systems and Languages. NorthHoll., Amsterdam 1975"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF00289240","volume":"21","author":"O. K. Ibarra","year":"1984","unstructured":"O. K. Ibarra and S. M. Kim: A characterization of systolic binary tree automata and applications. Acta Informatica 21, 193\u2013207 (1984)","journal-title":"Acta Informatica"},{"key":"16_CR11","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"J.E. Hopcroft and J.D. Ullman: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading Mass. 1979."},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01744286","volume":"13","author":"N. Jones","year":"1979","unstructured":"N. Jones and S. Skyum: Complexity of some problems concerning L systems. Math. Systems Theory, 13, 29\u201343 (1979)","journal-title":"Math. Systems Theory"},{"key":"16_CR13","first-page":"45","volume-title":"The Book of L.","author":"K.-J. Lange","year":"1986","unstructured":"K.-J. Lange: L systems and NLOG-reductions. In: G. Rozenberg and A. Salomaa (editors): The Book of L. Berlin: Springer-Verlag 1986, pp.45\u201391."},{"key":"16_CR14","series-title":"LNCS 381","first-page":"19","volume-title":"Proc. of the 5-th IMYCS","author":"K.-J. Lange","year":"1989","unstructured":"K.-J. Lange: Complexity Theory and Formal Languages. In: Proc. of the 5-th IMYCS, LNCS 381, Berlin: Springer-Verlag 1989, pp.19\u201336."},{"key":"16_CR15","first-page":"33","volume":"33","author":"K.-J. Lange","year":"1979","unstructured":"K.-J. Lange and M. Schudy: A further link between formal languages and complexity theory. EATCS bull., 33, 33\u201367 (1979)","journal-title":"EATCS bull."},{"key":"16_CR16","first-page":"166","volume-title":"Lindenmayer Systems","author":"K.-J. Lange","year":"1992","unstructured":"K.-J. Lange and M. Schudy: The Complexity of the Emptiness Problem for E0L Systems. In G. Rozenberg and A. Salomaa (editors): Lindenmayer Systems. Berlin: Springer-Verlag 1992, pp. 166\u2013175."},{"key":"16_CR17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1080\/00207167408803089","volume":"4","author":"G. Rozenberg","year":"1974","unstructured":"G. Rozenberg: On a family of acceptors for some classes of developmental languages. Internat. J. Comput. Math. 4, 199\u2013228 (1974)","journal-title":"Internat. J. Comput. Math."},{"key":"16_CR18","volume-title":"The Mathematical Theory of L systems","author":"G. Rozenberg","year":"1980","unstructured":"G. Rozenberg and A. Salomaa: The Mathematical Theory of L systems. New York: Academic Press 1980"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57811-0_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T05:44:32Z","timestamp":1640929472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57811-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578116","9783540483373"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-57811-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}