{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:04:30Z","timestamp":1725555870239},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130885"},{"type":"electronic","value":"9783642130892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13089-2_18","type":"book-chapter","created":{"date-parts":[[2010,5,7]],"date-time":"2010-05-07T12:05:27Z","timestamp":1273233927000},"page":"214-226","source":"Crossref","is-referenced-by-count":9,"title":["Operator Precedence and the Visibly Pushdown Property"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Crespi Reghizzi","sequence":"first","affiliation":[]},{"given":"Dino","family":"Mandrioli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC: ACM Symposium on Theory of Computing, STOC (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM\u00a056(3) (2009)","DOI":"10.1145\/1516512.1516518"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-45711-9_1","volume-title":"Formal and Natural Computing","author":"J. Berstel","year":"2002","unstructured":"Berstel, J., Boasson, L.: Balanced grammars and their languages. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol.\u00a02300, pp. 3\u201325. Springer, Heidelberg (2002)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/11779148_12","volume-title":"Developments in Language Theory","author":"D. Caucal","year":"2006","unstructured":"Caucal, D.: Synchronization of pushdown automata. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 120\u2013132. Springer, Heidelberg (2006)"},{"key":"18_CR5","unstructured":"Crespi Reghizzi, S.: The mechanical acquisition of precedence grammars. PhD thesis, University of California UCLA, School of Engineering (1970)"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1137\/0210013","volume":"10","author":"S. Crespi-Reghizzi","year":"1981","unstructured":"Crespi-Reghizzi, S., Guida, G., Mandrioli, D.: Operator precedence grammars and the noncounting property. SICOMP: SIAM Journ. on Computing\u00a010, 174\u2013191 (1981)","journal-title":"SICOMP: SIAM Journ. on Computing"},{"key":"18_CR7","unstructured":"Crespi-Reghizzi, S., Mandrioli, D.: Algebraic properties of structured context-free languages: old approaches and novel developments. In: WORDS 2009 - 7th Int. Conf. on Words, preprints (2009), \n                    \n                      http:\/\/arXiv.org\/abs\/0907.2130"},{"issue":"2","key":"18_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0019-9958(78)90474-6","volume":"37","author":"S. Crespi-Reghizzi","year":"1978","unstructured":"Crespi-Reghizzi, S., Mandrioli, D., Martin, D.F.: Algebraic properties of operator precedence languages. Information and Control\u00a037(2), 115\u2013133 (1978)","journal-title":"Information and Control"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/800169.805432","volume-title":"STOC \u201969: Proc. first annual ACM Symp. on Theory of Computing","author":"M.J. Fischer","year":"1969","unstructured":"Fischer, M.J.: Some properties of precedence languages. In: STOC \u201969: Proc. first annual ACM Symp. on Theory of Computing, pp. 181\u2013190. ACM, New York (1969)"},{"issue":"3","key":"18_CR10","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1145\/321172.321179","volume":"10","author":"R.W. Floyd","year":"1963","unstructured":"Floyd, R.W.: Syntactic analysis and operator precedence. J. ACM\u00a010(3), 316\u2013333 (1963)","journal-title":"J. ACM"},{"key":"18_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68954-8","volume-title":"Parsing techniques: a practical guide","author":"D. Grune","year":"2008","unstructured":"Grune, D., Jacobs, C.J.: Parsing techniques: a practical guide. Springer, New York (2008)"},{"issue":"3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/321406.321411","volume":"14","author":"R. McNaughton","year":"1967","unstructured":"McNaughton, R.: Parenthesis grammars. J. ACM\u00a014(3), 490\u2013500 (1967)","journal-title":"J. ACM"},{"key":"18_CR13","volume-title":"Counter-free Automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-free Automata. MIT Press, Cambridge (1971)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-74456-6_13","volume-title":"Mathematical Foundations of Computer Science 2007","author":"D. Nowotka","year":"2007","unstructured":"Nowotka, D., Srba, J.: Height-deterministic pushdown automata. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 125\u2013134. Springer, Heidelberg (2007)"},{"key":"18_CR15","volume-title":"Formal Languages","author":"A.K. Salomaa","year":"1973","unstructured":"Salomaa, A.K.: Formal Languages. Academic Press, London (1973)"},{"key":"18_CR16","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","volume":"1","author":"J. Thatcher","year":"1967","unstructured":"Thatcher, J.: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. Journ. of Comp. and Syst. Sc.\u00a01, 317\u2013322 (1967)","journal-title":"Journ. of Comp. and Syst. Sc."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13089-2_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:54:33Z","timestamp":1619783673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13089-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130885","9783642130892"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13089-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}