Characterizing weighted MSO for trees by branching transitive closure logics

DOI10.1016/j.tcs.2015.04.024zbMath1353.03040arXiv1208.5317OpenAlexW2072095576MaRDI QIDQ2355685

Zoltán Fülöp, Heiko Vogler

Publication date: 24 July 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.5317

zbMATH Keywords

transitive closureweighted monadic second-order logicweighted tree automata

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weighted automata and multi-valued logics over arbitrary bounded lattices
• Handbook of weighted automata
• Weighted tree automata and weighted logics
• Compositions of tree series transformations
• Recognizable formal power series on trees
• Classifying regular events in symbolic logic
• Weighted automata and weighted logics
• Weighted logics for unranked tree automata
• Tree acceptors and some of their applications
• Transitive closure logic, nested tree walking automata, and XPath
• Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices
• Pebble Weighted Automata and Transitive Closure Logics
• Weighted Automata and Weighted Logics
• Weighted Automata Algorithms
• Weighted Tree Automata and Tree Transducers
• Traces, Series-Parallel Posets, and Pictures: A Weighted Study
• Digital Image Compression
• Applications of Weighted Automata in Natural Language Processing
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Automata, Languages and Programming