Effective optimization with weighted automata on decomposable trees
From MaRDI portal
Recommendations
- Minimizing Deterministic Weighted Tree Automata
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- scientific article; zbMATH DE number 4195982
- DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
- The inclusion problem for weighted automata on infinite trees
Cites work
- A Kleene theorem for weighted tree automata over distributive multioperator monoids
- A survey on OR and mathematical methods applied on gene-environment networks
- Algorithmic uses of the Feferman-Vaught theorem
- Directed Unfolding of Petri Nets
- Fusion in relational structures and the verification of monadic second-order properties
- Incremental model checking for decomposable structures
- Linear Recurrence Relations for Graph Polynomials
- Modest theory of short chains. I
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On optimization, dynamics and uncertainty: A tutorial for gene-environment networks
- On the Very Weak 0–1 Law for Random Graphs with Orders
- Recursive families of graphs
- Some aspects of studying an optimization or decision problem in different computational models
- The monadic theory of order
- Weak Second‐Order Arithmetic and Finite Automata
- Weighted automata and weighted logics
- Weighted logics for unranked tree automata
- Weighted Picture Automata and Weighted Logics
Cited in
(3)
This page was built for publication: Effective optimization with weighted automata on decomposable trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5413875)