A Büchi-like theorem for weighted tree automata over multioperator monoids
From MaRDI portal
Publication:692910
DOI10.1007/s00224-010-9296-1zbMath1280.03045OpenAlexW2047705796MaRDI QIDQ692910
Heiko Vogler, Zoltán Fülöp, Torsten Stüber
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
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)
Related Items
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids, Unnamed Item, Weighted automata with storage, Characterizations of recognizable weighted tree languages by logic and bimorphisms, A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties, Kleene and Büchi theorems for weighted forest languages over M-monoids, Linear weighted tree automata with storage and inverse linear tree homomorphisms, Weighted Automata and Logics on Infinite Graphs, Weighted Symbolic Automata with Data Storage, Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics, A link between multioperator and tree valuation automata and logics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Logical definability on infinite traces
- Weighted tree automata and weighted logics
- Effective construction of the syntactic algebra of a recognizable series on trees
- Weighted grammars and Kleene's theorem
- 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
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems
- A Kleene theorem for weighted tree automata over distributive multioperator monoids
- Fuzzy tree automata
- Weighted automata and weighted logics
- Weighted logics for unranked tree automata
- Weighted picture automata and weighted logics
- Tree acceptors and some of their applications
- Weak Second‐Order Arithmetic and Finite Automata
- Weighted Logics for Traces
- Deciding Equivalence of Finite Tree Automata
- Weighted Automata and Weighted Logics with Discounting
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices
- DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
- Weighted Timed MSO Logics
- Decision Problems of Finite Automata Design and Related Arithmetics
- Bottom-up and top-down tree transformations— a comparison
- Logics for Unranked Trees: An Overview
- Definable Transductions and Weighted Logics for Texts
- 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
- Automata, Languages and Programming
