{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:03Z","timestamp":1759638723527},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,12,4]],"date-time":"2013-12-04T00:00:00Z","timestamp":1386115200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s00236-013-0190-6","type":"journal-article","created":{"date-parts":[[2013,12,3]],"date-time":"2013-12-03T02:34:55Z","timestamp":1386038095000},"page":"25-49","source":"Crossref","is-referenced-by-count":6,"title":["Visibly rational expressions"],"prefix":"10.1007","volume":"51","author":[{"given":"Laura","family":"Bozzelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9sar","family":"S\u00e1nchez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,4]]},"reference":[{"key":"190_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R.: Marrying words and trees. In: Proceedings of the 26th ACM Symposium on Principles of Database Systems (PODS\u201907), pp. 233\u2013242. ACM (2007)","DOI":"10.1145\/1265530.1265564"},{"key":"190_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Etessami, K., Madhusudan, P.: A temporal logic of nested calls and returns. In: Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201904), vol. 2988 of LNCS, pp. 467\u2013481. Springer (2004)","DOI":"10.1007\/978-3-540-24730-2_35"},{"key":"190_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Kumar, V., Madhusudan, P., Viswanathan, M.: Congruences for visibly pushdown languages. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP\u201905), vol. 3580 of LNCS, pp. 1102\u20131114. Springer (2005)","DOI":"10.1007\/11523468_89"},{"key":"190_CR4","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC\u201904), pp. 202\u2013211. ACM (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"190_CR5","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM, 56(3) (2009)","DOI":"10.1145\/1516512.1516518"},{"key":"190_CR6","doi-asserted-by":"crossref","unstructured":"Arenas, M., Barcel\u00f3, P., Libkin, L.: Regular languages of nested words: fixed points, automata, and synchronization. In: Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP\u201907), vol. 4596 of LNCS, pp. 888\u2013900. Springer (2007)","DOI":"10.1007\/978-3-540-73420-8_76"},{"key":"190_CR7","doi-asserted-by":"crossref","unstructured":"Ball, T., Rajamani, S.K.: Bebop: a symbolic model checker for boolean programs. In: Proceedings of the 7th International Workshop on Model Checking and Software Verification (SPIN\u201900), vol. 1885 of LNCS, pp. 113\u2013130. Springer (2000)","DOI":"10.1007\/10722468_7"},{"key":"190_CR8","doi-asserted-by":"crossref","unstructured":"Bolduc, C., Ktari, B.: Visibly pushdown kleene algebra and its use in interprocedural analysis of (Mutually) recursive programs. In: Proceedings of the 11th International Conference on Relational Methods in Computer Science (RelMiCS\u201909), vol. 5827 of LNCS, pp. 44\u201358. Springer (2009)","DOI":"10.1007\/978-3-642-04639-1_4"},{"key":"190_CR9","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: application to model-checking. In: Proceedings of the 8th International Conference on Concurrency Theory (CONCUR\u201997), vol. 1243 of LNCS, pp. 135\u2013150. Springer (1997)","DOI":"10.1007\/3-540-63141-0_10"},{"key":"190_CR10","doi-asserted-by":"crossref","unstructured":"Bozzelli, L.: Alternating automata and a temporal fixpoint calculus for visibly pushdown languages. In: Proceedings of the 18th International Conference on Concurrency Theory (CONCUR\u201907), vol. 4703 of LNCS, pp. 476\u2013491. Springer (2007)","DOI":"10.1007\/978-3-540-74407-8_32"},{"issue":"1","key":"190_CR11","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"AK Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114\u2013133 (1981)","journal-title":"J. ACM"},{"key":"190_CR12","unstructured":"Cyriac, A.: Temporal logics for concurrent recursive programs. Rapport de Master, Master Parisien de Recherche en Informatique, Paris (2010)"},{"key":"190_CR13","unstructured":"Fisman, D., Eisner, C., Havlicek, J.: Formal syntax and semantics of PSL: appendix B of accellera property language reference manual, Version 1.1. (2004)"},{"key":"190_CR14","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, MA (1979)"},{"key":"190_CR15","doi-asserted-by":"crossref","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Automata Studies, vol. 34, pp. 3\u201341. Princeton University Press (1956)","DOI":"10.1515\/9781400882618-002"},{"key":"190_CR16","doi-asserted-by":"crossref","unstructured":"Koch, C., Scherzinger, S.: Attribute Grammars for Scalable Query Processing on XML Streams. In Proc. of the 9th International Workshop on Database Programming Languages (DBPL\u201903), volume 2921 of LNCS, pages 233\u2013256. Springer (2004)","DOI":"10.1007\/978-3-540-24607-7_15"},{"key":"190_CR17","doi-asserted-by":"crossref","unstructured":"Kumar, V., Madhusudan, P., Viswanathan, M.: Visibly pushdown automata for streaming XML. In: Proceedings of the 16th International Conference on World Wide Web (WWW\u201907), pp. 1053\u20131062. ACM (2007)","DOI":"10.1145\/1242572.1242714"},{"key":"190_CR18","doi-asserted-by":"crossref","unstructured":"Leucker, M., S\u00e1nchez, C.: Regular linear temporal logic. In: Proceedings of the 4th International Colloquium on Theoretical Aspects of Computing (ICTAC\u201907), vol. 4711 of LNCS, pp. 291\u2013305. Springer (2007)","DOI":"10.1007\/978-3-540-75292-9_20"},{"key":"190_CR19","doi-asserted-by":"crossref","unstructured":"L\u00f6ding, C., Madhusudan, P., Serre, O.: Visibly pushdown games. In: Proceedings of the 24th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS\u201904), vol. 3328 of LNCS, pp. 408\u2013420. Springer (2004)","DOI":"10.1007\/978-3-540-30538-5_34"},{"key":"190_CR20","doi-asserted-by":"crossref","unstructured":"Madhusudan, P., Viswanathan, M.: Query automata for XML nested words. In: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS\u201909), vol. 5734 of LNCS, pp. 561\u2013573. Springer (2009)","DOI":"10.1007\/978-3-642-03816-7_48"},{"key":"190_CR21","unstructured":"Pitcher, C.: Visibly Pushdown expression effects for XML stream processing. In: Proceedings of the ACM Workshop on Programming Language Technologies for XML (PLAN-X\u201905), pp. 1\u201314. ACM (2005)"},{"key":"190_CR22","doi-asserted-by":"crossref","unstructured":"Thomo, A., Venkatesh, S., Ye, Y.Y.: Visibly pushdown transducers for approximate validation of streaming XML. In: Proceedings of 5th International Symposium on Foundations of Information and Knowledge Systems (FoIKS\u201908), vol. 4932 of LNCS, pp. 219\u2013238. Springer (2008)","DOI":"10.1007\/978-3-540-77684-0_16"},{"issue":"6","key":"190_CR23","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K Thompson","year":"1968","unstructured":"Thompson, K.: Regular expression search algorithm. Commun. ACM 11(6), 419\u2013422 (1968)","journal-title":"Commun. ACM"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-013-0190-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-013-0190-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-013-0190-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T06:48:21Z","timestamp":1564901301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-013-0190-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,4]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["190"],"URL":"https:\/\/doi.org\/10.1007\/s00236-013-0190-6","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,4]]}}}