A Büchi-like theorem for weighted tree automata over multioperator monoids
From MaRDI portal
Publication:692910
DOI10.1007/S00224-010-9296-1zbMATH Open1280.03045OpenAlexW2047705796MaRDI QIDQ692910FDOQ692910
Authors: Zoltán Fülöp, Torsten Stüber, Heiko Vogler 
Publication date: 6 December 2012
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-010-9296-1
Recommendations
- A link between multioperator and tree valuation automata and logics
- A Kleene theorem for weighted tree automata over distributive multioperator monoids
- Weighted tree automata and weighted logics
- A Kleene theorem for weighted tree automata over tree valuation monoids
- Kleene and Büchi theorems for weighted forest languages over M-monoids
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)
Cites Work
- Bottom-up and top-down tree transformations— a comparison
- Deciding Equivalence of Finite Tree Automata
- Title not available (Why is that?)
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems
- Weak Second‐Order Arithmetic and Finite Automata
- Title not available (Why is that?)
- Decision Problems of Finite Automata Design and Related Arithmetics
- Logical definability on infinite traces
- Tree acceptors and some of their applications
- Kleene and Büchi theorems for weighted automata and multi-valued logics over arbitrary bounded lattices
- Automata, Languages and Programming
- Logics for Unranked Trees: An Overview
- Weighted automata and weighted logics
- Weighted Muller tree automata and weighted logics
- Weighted logics for unranked tree automata
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- Weighted tree automata and weighted logics
- Weighted Logics for Traces
- Weighted Timed MSO Logics
- Definable Transductions and Weighted Logics for Texts
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Recognizable formal power series on trees
- A Kleene theorem for weighted tree automata
- Title not available (Why is that?)
- Effective construction of the syntactic algebra of a recognizable series on trees
- Weighted grammars and Kleene's theorem
- A Kleene theorem for weighted tree automata over distributive multioperator monoids
- Fuzzy tree automata
- Weighted picture automata and weighted logics
- Weighted Automata and Weighted Logics with Discounting
- DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
- Title not available (Why is that?)
- Title not available (Why is that?)
- RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Developments in Language Theory
Cited In (13)
- Title not available (Why is that?)
- Weighted automata and logics on infinite graphs
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
- Kleene and Büchi theorems for weighted forest languages over M-monoids
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- Linear weighted tree automata with storage and inverse linear tree homomorphisms
- Weighted symbolic automata with data storage
- A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties
- Characterizations of recognizable weighted tree languages by logic and bimorphisms
- Weighted automata with storage
- DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
- A link between multioperator and tree valuation automata and logics
- Title not available (Why is that?)
This page was built for publication: A Büchi-like theorem for weighted tree automata over multioperator monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692910)
