{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:11Z","timestamp":1742617151484,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544586"},{"type":"electronic","value":"9783540383918"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54458-5_59","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:52:02Z","timestamp":1330210322000},"page":"146-156","source":"Crossref","is-referenced-by-count":0,"title":["Deterministic dequeue automata and LL(1) parsing of breadth-depth grammars"],"prefix":"10.1007","author":[{"given":"Luca","family":"Breveglieri","sequence":"first","affiliation":[]},{"given":"Claudio","family":"Citrini","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Crespi-Reghizzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"16_CR1","unstructured":"M. Harrison, Introduction to formal Languages Theory, Addison-Wesley, 1978"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"J. E. Hopcroft, A. J. Korenjack, Simple deterministic Languages, Proc. 7 th IEEE Symposium on Switching and Automata Theory, pp. 36\u201346, 1966","DOI":"10.1109\/SWAT.1966.22"},{"issue":"3","key":"16_CR3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1142\/S0129054190000163","volume":"1","author":"A. Cherubini","year":"1990","unstructured":"A. Cherubini et al., Deque Automata and Breadth-Depth Grammars, International Journal of Foundations of Computer Science, vol. 1, n. 3, pp. 219\u2013232, World Scientific Publishing Company, 1990","journal-title":"International Journal of Foundations of Computer Science"},{"key":"16_CR4","unstructured":"L. Breveglieri, Breadth-Depth Grammars and Dequeue Automata: Characterization of Determinism and Complexity, Int. Rep. n. 90-021, Dept. of Electronics, Politecnico di Milano, 1990"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"A. Cherubini et al., QRT FIFO Automata, Breadth-first Grammars and their Relations, TCS, 1991","DOI":"10.1016\/0304-3975(91)90053-5"},{"key":"16_CR6","first-page":"162","volume":"324","author":"E. Allevi","year":"1988","unstructured":"E. Allevi, A. Cherubini, S. Crespi-Reghizzi, Breadth-first Grammars and Queue Automata, in Mathematical Foundations of Computer Science, M. P. Chytil, L. Janiga, V. Koubek (eds.), Springer Verlag, LNCS 324, pp. 162\u2013170, 1988","journal-title":"Springer Verlag, LNCS"},{"key":"16_CR7","unstructured":"L. Breveglieri et al., Multi-Stack multi-Queue Grammars and their Languages, Int. Rep. n. 90-053, Dept. of Electronics, Politecnico di Milano, 1990"},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(88)90019-9","volume":"58","author":"F. J. Brandenburg","year":"1988","unstructured":"F. J. Brandenburg, On the Intersections of Stacks and Queues, TCS 58, pp. 69\u201380, 1988","journal-title":"TCS"},{"issue":"3","key":"16_CR9","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0019-9958(70)90446-8","volume":"17","author":"D. J. Rosenkrantz","year":"1970","unstructured":"D. J. Rosenkrantz, R. E. Stearns, Properties of deterministic Top-down Grammars, Information and Control, vol. 17, n. 3, pp. 226\u2013256, 1970","journal-title":"Information and Control"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(80)90047-X","volume":"11","author":"B. Vauquelin","year":"1980","unstructured":"B. Vauquelin, B. Franchi-Zannettacci, Automates \u00e0 File, TCS 11, pp. 221\u2013225, 1980","journal-title":"TCS"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"D. Hemmendinger, Specifying ADA Server Tasks with executable formal Grammars, IEEE TSE, vol. 16, n. 7, July, 1990","DOI":"10.1109\/32.56100"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54458-5_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:19:27Z","timestamp":1742591967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54458-5_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544586","9783540383918"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-54458-5_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}