Pages that link to "Item:Q1015390"
From MaRDI portal
The following pages link to Hardness of equivalence checking for composed finite-state systems (Q1015390):
Displaying 7 items.
- Hardness of preorder checking for basic formalisms (Q650916) (← links)
- Complexity of equivalence problems for concurrent systems of finite agents (Q1383143) (← links)
- HARD: A hypercube embedding algorithm for state assignment of finite state machines (Q1860064) (← links)
- Equivalence checking of Petri net models of programs using static and dynamic cut-points (Q2415374) (← links)
- Equivalences of Pushdown Systems Are Hard (Q5410661) (← links)
- CONCUR 2003 - Concurrency Theory (Q5900569) (← links)
- Nondeterministic seedless oritatami systems and hardness of testing their equivalence (Q6061982) (← links)