Skip to content
<title>Channels - The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete) :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
Search for more channels:
Similar Items: The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
Channel Options
View Record
Explore related channels
Quick Look
Proof equivalence in MLL is PSPACE-complete
Quick Look
The Big-O Problem
Quick Look
Deciding the value 1 problem for probabilistic leaktight automata
Quick Look
Decidability Results for the Boundedness Problem
Quick Look
Decidability Problems for Actor Systems
Quick Look
Bounded Reachability Problems are Decidable in FIFO Machines
Quick Look
LCPP: Learning Curve Plus Plus
Quick Look
Minimization of visibly pushdown automata is NP-complete
Quick Look
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
Quick Look
Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
Quick Look
Reachability Problem for Weak Multi-Pushdown Automata
Quick Look
Language Preservation Problems in Parametric Timed Automata
Quick Look
Deciding Conditional Termination
Quick Look
Decidability for Sturmian words
Quick Look
Decidability of higher-order matching
Quick Look
Deciding Kleene Algebras in Coq
Quick Look
Deciding definability in FO2(
Quick Look
Decidable Expansions of Labelled Linear Orderings
Quick Look
The logical strength of Büchi's decidability theorem
Quick Look
Decidability for Entailments of Symbolic Heaps with Arrays
Quick Look
Deciding Equations in the Time Warp Algebra
Quick Look
Craig Interpolation for Decidable First-Order Fragments
Quick Look
Decidability of extensions of Presburger arithmetic by generalised polynomials
Quick Look
A Reduced Semantics for Deciding Trace Equivalence
Load more items
View Record
Prev
Explore related channels
Next
