A link between multioperator and tree valuation automata and logics

DOI10.1016/j.tcs.2015.04.033zbMath1330.68182OpenAlexW293593254MaRDI QIDQ2355687

Markus Teichmann, Johannes Osterholzer

Publication date: 24 July 2015

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.04.033

zbMATH Keywords

MSO logictree languageweighted tree automatonweighted logicmultioperator monoidtree valuation monoid

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05)

Related Items

A Kleene theorem for weighted tree automata over tree valuation monoids, Characterizations of recognizable weighted tree languages by logic and bimorphisms, Kleene and Büchi theorems for weighted forest languages over M-monoids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Büchi-like theorem for weighted tree automata over multioperator monoids
• Weighted tree automata and weighted logics
• A Kleene theorem for weighted tree automata
• A Kleene theorem for weighted tree automata over distributive multioperator monoids
• Weighted automata and weighted logics
• Tree acceptors and some of their applications
• Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
• Weak Second‐Order Arithmetic and Finite Automata
• DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
• Decision Problems of Finite Automata Design and Related Arithmetics
• MINIMAL RECOGNIZERS AND SYNTACTIC MONOIDS OF DR TREE LANGUAGES
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Developments in Language Theory