The following pages link to (Q3668872):
Displayed 14 items.
- On the structure of linear apex NLC graph grammars (Q441855) (← links)
- Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete (Q761043) (← links)
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states (Q1096388) (← links)
- Completeness results for conflict-free vector replacement systems (Q1113674) (← links)
- Normal and sinkless Petri nets (Q1208921) (← links)
- Analysis of a class of communicating finite state machines (Q1323365) (← links)
- On reachability equivalence for BPP-nets (Q1391745) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- The synthesis of Petri nets from path-automatic specifications (Q1882929) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- On the Containment Problem for Linear Sets (Q3304154) (← links)
- A Fully Equational Proof of Parikh's Theorem (Q4787831) (← links)
- Operational State Complexity and Decidability of Jumping Finite Automata (Q5384429) (← links)
- Synchronization of Parikh automata (Q6067332) (← links)