The following pages link to Michael Blondin (Q347112):
Displaying 5 items.
- The complexity of intersecting finite automata having few final states (Q347114) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete (Q4635789) (← links)
- (Q5114831) (← links)
- Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations (Q6487345) (← links)
