Weighted Automata and Logics for Infinite Nested Words
Nested words introduced by Alur and Madhusudan are used to capture structures with both linear and hierarchical order, e.g. XML documents, without losing valuable closure properties. Furthermore, Alur and Madhusudan introduced automata and equivalent logics for both finite and infinite nested words, thus extending Büchi’s theorem to nested words. Recently, average and discounted computations of weights in quantitative systems found much interest. Here, we will introduce and investigate weighted automata models and weighted MSO logics for infinite nested words. As weight structures we consider valuation monoids which incorporate average and discounted computations of weights as well as the classical semirings. We show that under suitable assumptions, two resp. three fragments of our weighted logics can be transformed into each other. Moreover, we show that the logic fragments have the same expressive power as weighted nested word automata.
Keywordsnested words weighted automata weighted logics quantitative automata valuation monoids
Unable to display preview. Download preview PDF.
- 2.Alur, R., Madhusudan, P.: Adding nesting structure to words. Journal of the ACM 56(3), 16:1–16:43 (2009)Google Scholar
- 3.Berstel, J., Reutenauer, C.: Rational Series and Their Languages. EATCS Monographs in Theoretical Computer Science, vol. 12. Springer (1988)Google Scholar
- 7.Chatterjee, K., Doyen, L., Henzinger, T.A.: Expressiveness and closure properties for quantitative languages. In: LICS, pp. 199–208. IEEE Computer Society (2009)Google Scholar
- 8.Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science. Springer (2009)Google Scholar
- 10.Droste, M., Götze, D., Märcker, S., Meinecke, I.: Weighted tree automata over valuation monoids and their characterization by weighted logics. In: Kuich, W., Rahonis, G. (eds.) Algebraic Foundations in Computer Science. LNCS, vol. 7020, pp. 30–55. Springer, Heidelberg (2011)Google Scholar
- 14.Eilenberg, S.: Automata, Languages, and Machines, Volume A, Pure and Applied Mathematics, vol. 59. Academic Press (1974)Google Scholar
- 16.Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs in Theoretical Computer Science, vol. 6. Springer (1986)Google Scholar
- 19.Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer (1978)Google Scholar
- 21.Trakhtenbrot, B.A.: Finite automata and logic of monadic predicates. Doklady Akademii Nauk SSR 140, 326–329 (1961) (in Russian)Google Scholar