A Büchi-like theorem for weighted tree automata over multioperator monoids
From MaRDI portal
(Redirected from Publication:692910)
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
Cites work
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 3493901 (Why is no real title available?)
- scientific article; zbMATH DE number 1948151 (Why is no real title available?)
- scientific article; zbMATH DE number 2040322 (Why is no real title available?)
- scientific article; zbMATH DE number 6124028 (Why is no real title available?)
- A Kleene theorem for weighted tree automata
- A Kleene theorem for weighted tree automata over distributive multioperator monoids
- Automata, Languages and Programming
- Bottom-up and top-down tree transformations— a comparison
- DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
- Deciding Equivalence of Finite Tree Automata
- Decision Problems of Finite Automata Design and Related Arithmetics
- Definable Transductions and Weighted Logics for Texts
- Developments in Language Theory
- Effective construction of the syntactic algebra of a recognizable series on trees
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Fuzzy tree automata
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Kleene and Büchi theorems for weighted automata and multi-valued logics over arbitrary bounded lattices
- Logical definability on infinite traces
- Logics for Unranked Trees: An Overview
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems
- RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
- Recognizable formal power series on trees
- Tree acceptors and some of their applications
- Weak Second‐Order Arithmetic and Finite Automata
- Weighted Automata and Weighted Logics with Discounting
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- Weighted Logics for Traces
- Weighted Muller tree automata and weighted logics
- Weighted Timed MSO Logics
- Weighted automata and weighted logics
- Weighted grammars and Kleene's theorem
- Weighted logics for unranked tree automata
- Weighted picture automata and weighted logics
- Weighted tree automata and weighted logics
Cited in
(13)- scientific article; zbMATH DE number 6124028 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 7644294 (Why is no real title available?)
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)
