Weighted Logics for Unranked Tree Automata

We define a weighted monadic second order logic for unranked trees and the concept of weighted unranked tree automata, and we investigate the expressive power of these two concepts. We show that weighted tree automata and a syntactically restricted weighted MSO-logic have the same expressive power in case the semiring is commutative or in case we deal only with ranked trees, but, surprisingly, not in general. This demonstrates a crucial difference between the theories of ranked trees and unranked trees in the weighted case.

[1]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[2]  Ingmar Meinecke.  Weighted Logics for Traces , 2006, CSR.

[3]  Thomas Schwentick,et al.  Query automata over finite trees , 2002, Theor. Comput. Sci..

[4]  Ina Mäurer.  Weighted picture automata and weighted logics , 2006 .

[5]  Leonid Libkin.  Logics for Unranked Trees: An Overview , 2005, ICALP.

[6]  Derick Wood,et al.  Regular Tree Languages Over Non-Ranked Alphabets , 1998 .

[7]  Arto Salomaa,et al.  Semirings, Automata, Languages , 1985, EATCS Monographs on Theoretical Computer Science.

[8]  Werner Kuich.  Formal Power Series over Trees , 1997, Developments in Language Theory.

[9]  George Rahonis,et al.  Weighted Muller Tree Automata and Weighted Logics , 2007, J. Autom. Lang. Comb..

[10]  C. C. Elgot.  Decision problems of finite automata design and related arithmetics , 1961 .

[11]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[12]  Thomas Schwentick,et al.  Numerical document queries , 2003, PODS.

[13]  C. M. Sperberg-McQueen,et al.  Extensible Markup Language (XML) , 1997, World Wide Web J..

[14]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[15]  James W. Thatcher,et al.  Generalized finite automata theory with an application to a decision problem of second-order logic , 1968, Mathematical systems theory.

[16]  James W. Thatcher,et al.  Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory , 1967, J. Comput. Syst. Sci..

[17]  M. Droste,et al.  Handbook of Weighted Automata , 2009 .

[18]  Werner Kuich,et al.  Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata , 1997, Handbook of Formal Languages.

[19]  J W Ballard,et al.  Data on the web? , 1995, Science.

[20]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[21]  Frank Neven.  Design and analysis of query languages for structured documents. A formal and logical approach , 1999 .

[22]  Ferenc Gécseg,et al.  Tree Languages , 1997, Handbook of Formal Languages.

[23]  Derick Wood,et al.  Regular tree and regular hedge languages over unranked alphabets , 2001 .

[24]  Christian Mathissen.  Definable transductions and weighted logics for texts , 2010, Theor. Comput. Sci..

[25]  Naoki Kobayashi,et al.  Resource Usage Analysis for the p-Calculus , 2006, Log. Methods Comput. Sci..

[26]  Manfred Droste,et al.  Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics , 2011, Algebraic Foundations in Computer Science.

[27]  Frank Neven,et al.  Automata, Logic, and XML , 2002, CSL.

[28]  Daniel Krob,et al.  The Equality Problem for Rational Series with Multiplicities in the tropical Semiring is Undecidable , 1992, Int. J. Algebra Comput..

[29]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[30]  Thomas Schwentick,et al.  XML: Model, Schemas, Types, Logics, and Queries , 2003, Logics for Emerging Applications of Databases.

[31]  Symeon Bozapalidis,et al.  Weighted Grammars and Kleene's Theorem , 1987, Inf. Process. Lett..

[32]  Arto Salomaa,et al.  Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.

[33]  Paul Gastin,et al.  Weighted automata and weighted logics , 2005, Theor. Comput. Sci..

[34]  Christian Mathissen.  Weighted Logics for Nested Words and Algebraic Formal Power Series , 2008, ICALP.

[35]  Marcel Paul Schützenberger,et al.  On the Definition of a Family of Automata , 1961, Inf. Control..

[36]  Jean Berstel,et al.  Recognizable Formal Power Series on Trees , 1982, Theor. Comput. Sci..

[37]  Ina Fichtner.  Weighted Picture Automata and Weighted Logics , 2009, Theory of Computing Systems.

[38]  Manfred Droste,et al.  Weighted tree automata and weighted logics , 2006, Theor. Comput. Sci..

[39]  Thomas Schwentick,et al.  Counting in Trees for Free , 2004, ICALP.

[40]  Ferenc Gécseg,et al.  Tree Automata , 2015, ArXiv.

[41]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[42]  Manfred Droste,et al.  Weighted automata and weighted logics with discounting , 2007, Theor. Comput. Sci..

[43]  H. Vogler,et al.  Weighted Tree Automata and Tree Transducers , 2009 .