Subcubic algorithms for recursive state machines
From MaRDI portal
Recommendations
- Analysis of recursive state machines
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
- Faster algorithms for weighted recursive state machines
- On-the-fly reachability and cycle detection for recursive state machines
- Timed recursive state machines: expressiveness and complexity
Cited in
(11)- Pushdown reachability with constant treewidth
- HARD: A hypercube embedding algorithm for state assignment of finite state machines
- Tight bounds for reachability problems on one-counter and pushdown systems
- Faster algorithms for algebraic path properties in recursive state machines with constant treewidth
- Cubic finite state machine
- Faster algorithms for weighted recursive state machines
- The Complexity of Andersen’s Analysis in Practice
- On-the-fly reachability and cycle detection for recursive state machines
- The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
- The complexity of bidirected reachability in valence systems
- The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
This page was built for publication: Subcubic algorithms for recursive state machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189835)