{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:36:05Z","timestamp":1725730565174},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_35","type":"book-chapter","created":{"date-parts":[[2013,6,9]],"date-time":"2013-06-09T22:16:25Z","timestamp":1370816185000},"page":"396-408","source":"Crossref","is-referenced-by-count":1,"title":["Operator Precedence \u03c9-Languages"],"prefix":"10.1007","author":[{"given":"Federica","family":"Panella","sequence":"first","affiliation":[]},{"given":"Matteo","family":"Pradella","sequence":"additional","affiliation":[]},{"given":"Violetta","family":"Lonati","sequence":"additional","affiliation":[]},{"given":"Dino","family":"Mandrioli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. Journ. ACM\u00a056(3) (2009)","key":"35_CR1","DOI":"10.1145\/1516512.1516518"},{"doi-asserted-by":"crossref","unstructured":"Barenghi, A., Crespi Reghizzi, S., Mandrioli, D., Pradella, M.: Parallel parsing of operator precedence grammars. Information Processing Letters (2013), doi:10.1016\/j.ipl.2013.01.008","key":"35_CR2","DOI":"10.1016\/j.ipl.2013.01.008"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-642-36089-3_15","volume-title":"Software Language Engineering","author":"A. Barenghi","year":"2013","unstructured":"Barenghi, A., Viviani, E., Crespi Reghizzi, S., Mandrioli, D., Pradella, M.: PAPAGENO: a parallel parser generator for operator precedence grammars. In: Czarnecki, K., Hedin, G. (eds.) SLE 2012. LNCS, vol.\u00a07745, pp. 264\u2013274. Springer, Heidelberg (2013)"},{"issue":"1-6","key":"35_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak Second-Order Arithmetic and Finite Automata. Mathematical Logic Quarterly\u00a06(1-6), 66\u201392 (1960)","journal-title":"Mathematical Logic Quarterly"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BFb0084787","volume-title":"CONCUR \u201992","author":"O. Burkart","year":"1992","unstructured":"Burkart, O., Steffen, B.: Model checking for context-free processes. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 123\u2013137. Springer, Heidelberg (1992)"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-13089-2_18","volume-title":"Language and Automata Theory and Applications","author":"S. Crespi Reghizzi","year":"2010","unstructured":"Crespi Reghizzi, S., Mandrioli, D.: Operator Precedence and the Visibly Pushdown Property. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 214\u2013226. Springer, Heidelberg (2010)"},{"issue":"6","key":"35_CR7","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.1016\/j.jcss.2011.12.006","volume":"78","author":"S. Crespi Reghizzi","year":"2012","unstructured":"Crespi Reghizzi, S., Mandrioli, D.: Operator Precedence and the Visibly Pushdown Property. Journal of Computer and System Science\u00a078(6), 1837\u20131867 (2012)","journal-title":"Journal of Computer and System Science"},{"issue":"3","key":"35_CR8","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. Journ. ACM\u00a010(3), 316\u2013333 (1963)","journal-title":"Journ. ACM"},{"key":"35_CR9","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)"},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-642-20712-9_23","volume-title":"Computer Science \u2013 Theory and Applications","author":"V. Lonati","year":"2011","unstructured":"Lonati, V., Mandrioli, D., Pradella, M.: Precedence Automata and Languages. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol.\u00a06651, pp. 291\u2013304. Springer, Heidelberg (2011)"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-35843-2_27","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"V. Lonati","year":"2013","unstructured":"Lonati, V., Mandrioli, D., Pradella, M.: Logic Characterization of Invisibly Structured Languages: the Case of Floyd Languages. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol.\u00a07741, pp. 307\u2013318. Springer, Heidelberg (2013)"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/SWCT.1963.8","volume-title":"Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design, SWCT 1963","author":"D.E. Muller","year":"1963","unstructured":"Muller, D.E.: Infinite sequences and finite machines. In: Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design, SWCT 1963, pp. 3\u201316. IEEE Computer Society, Washington, DC (1963)"},{"unstructured":"Panella, F.: Floyd languages for infinite words. Master\u2019s thesis, Politecnico di Milano (2011), \n                    \n                      http:\/\/home.dei.polimi.it\/panella","key":"35_CR13"},{"unstructured":"Panella, F., Pradella, M., Lonati, V., Mandrioli, D.: Operator precedence \u03c9-languages. CoRR abs\/1301.2476 (2013), \n                    \n                      http:\/\/arxiv.org\/abs\/1301.2476","key":"35_CR14"},{"unstructured":"Rabin, M.: Automata on infinite objects and Church\u2019s problem. Regional conference series in mathematics. Published for the Conference Board of the Mathematical Sciences by the American Mathematical Society (1972)","key":"35_CR15"},{"issue":"1-2","key":"35_CR16","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0019-9958(82)91258-X","volume":"54","author":"R.S. Streett","year":"1982","unstructured":"Streett, R.S.: Propositional dynamic logic of looping and converse is elementarily decidable. Information and Control\u00a054(1-2), 121\u2013141 (1982)","journal-title":"Information and Control"},{"key":"35_CR17","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 133\u2013191. MIT Press, Cambridge (1990)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38771-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T20:32:45Z","timestamp":1557779565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}