Recommendations
Cites work
- scientific article; zbMATH DE number 1670794 (Why is no real title available?)
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 176727 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- Algorithm Theory - SWAT 2004
- Complexity of automaton identification from given data
- Computer Aided Verification
- Expressiveness and closure properties for quantitative languages
- Making weighted containment feasible: a heuristic based on simulation and abstraction
- On Linear Characterizations of Combinatorial Optimization Problems
- Parametric real-time reasoning
- Quantitative Languages
- Quantitative Languages Defined by Functional Automata
- Reasoning about infinite computations
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- The ellipsoid method and its consequences in combinatorial optimization
- What's decidable about weighted automata?
Cited in
(4)
This page was built for publication: Parameterized weighted containment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946752)