Effective optimization with weighted automata on decomposable trees
From MaRDI portal
Publication:5413875
DOI10.1080/02331934.2013.865735zbMath1302.03046OpenAlexW2018070528MaRDI QIDQ5413875
V. Eh. Vol'kovich, Gerhard-Wilhelm Weber, Elena V. Ravve
Publication date: 2 May 2014
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2013.865735
weighted monadic second-order logicweighted tree automataplanning problemssum-like weighted labeled treesweighted translation scheme
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items
A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic., A logic-based approach to incremental reasoning on multi-agent systems
Cites Work
- Algorithmic uses of the Feferman-Vaught theorem
- A survey on OR and mathematical methods applied on gene-environment networks
- On optimization, dynamics and uncertainty: A tutorial for gene-environment networks
- The monadic theory of order
- Some aspects of studying an optimization or decision problem in different computational models
- A Kleene theorem for weighted tree automata over distributive multioperator monoids
- Weighted automata and weighted logics
- Weighted logics for unranked tree automata
- Recursive families of graphs
- Fusion in relational structures and the verification of monadic second-order properties
- Weak Second‐Order Arithmetic and Finite Automata
- Incremental model checking for decomposable structures
- Directed Unfolding of Petri Nets
- Modest theory of short chains. I
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On the Very Weak 0–1 Law for Random Graphs with Orders
- Weighted Picture Automata and Weighted Logics
- Linear Recurrence Relations for Graph Polynomials
