The following pages link to (Q4190159):
Displaying 25 items.
- Counter machines, Petri nets, and consensual computation (Q517037) (← links)
- Remarks on two-way automata with weak-counters (Q793509) (← links)
- Super-nets and their hierarchy (Q1050114) (← links)
- Extending regular expressions with iterated shuffle (Q1063422) (← links)
- CTS systems and Petri nets (Q1085981) (← links)
- Petri nets and regular languages (Q1158763) (← links)
- The power of synchronizing operations on strings (Q1161057) (← links)
- Two-way deterministic multi-weak-counter machines (Q1165028) (← links)
- A structure to decide reachability in Petri nets (Q1193891) (← links)
- \(X\)-automata on \(\omega\)-words (Q1210539) (← links)
- Refining the hierarchy of blind multicounter languages and twist-closed trios. (Q1427852) (← links)
- Langages à un compteur (Q1838045) (← links)
- Petri net languages and infinite subsets of \(\mathbb{N}^m\) (Q1970198) (← links)
- General decidability results for asynchronous shared-memory programs: higher-order and beyond (Q2044219) (← links)
- Reachability problems in low-dimensional nondeterministic polynomial maps over integers (Q2051802) (← links)
- Infinite behaviour of Petri nets (Q2265817) (← links)
- Recursive Petri nets (Q2464034) (← links)
- A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
- Consensual languages and matching finite-state computations (Q3006160) (← links)
- An Approach to Computing Downward Closures (Q3449495) (← links)
- A normal form theorem for label grammars (Q3938522) (← links)
- Methods for behavior descriptions of structure-complex Petri nets (Q4915283) (← links)
- Unboundedness Problems for Languages of Vector Addition Systems. (Q5002804) (← links)
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond (Q5060187) (← links)
- Groups Whose Word Problem is a Petri Net Language (Q5500697) (← links)
