Pages that link to "Item:Q1675163"

The following pages link to The emptiness problem for valence automata or: another decidable extension of Petri nets (Q1675163):

Displaying 3 items.

• Characterization and complexity results on jumping finite automata (Q2357104) (← links)
• The emptiness problem for valence automata over graph monoids (Q2662504) (← links)
• Coverability, Termination, and Finiteness in Recursive Petri Nets (Q5025058) (← links)