Pages that link to "Item:Q5941099"
From MaRDI portal
The following pages link to Nonprimitive recursive complexity and undecidability for Petri net equivalences (Q5941099):
Displaying 5 items.
- Verifying lossy channel systems has nonprimitive recursive complexity. (Q1853078) (← links)
- Petri nets and regular processes (Q1970202) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- (Q5207052) (← links)