The following pages link to (Q4353915):
Displaying 32 items.
- Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
- A theory of structural stationarity in the \(\pi\)-calculus (Q1014276) (← links)
- Non-interleaving bisimulation equivalences on basic parallel processes (Q1049404) (← links)
- Parikh's theorem: a simple and direct automaton construction (Q1944966) (← links)
- Bisimilarity on basic parallel processes (Q2072066) (← links)
- A practical approach to model checking duration calculus using Presburger arithmetic (Q2251131) (← links)
- Decidability of branching bisimulation on normed commutative context-free processes (Q2254493) (← links)
- Transformation of Petri nets into context-dependent fusion grammars (Q2278280) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- Decidable first-order transition logics for PA-processes (Q2575856) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- Parikh’s Theorem and Descriptional Complexity (Q2891382) (← links)
- Honesty by Typing (Q2974791) (← links)
- Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes (Q3090854) (← links)
- Petri Nets and Semilinear Sets (Extended Abstract) (Q3179388) (← links)
- Erasing in Petri Net Languages and Matrix Grammars (Q3637250) (← links)
- Tableau methods for PA-processes (Q4610333) (← links)
- Behavioural equivalence for infinite systems — Partially decidable! (Q4633177) (← links)
- (Q4763987) (← links)
- An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems (Q4917080) (← links)
- Concurrency for Graph Grammars in a Petri net shell (Q4923530) (← links)
- Reachability in Parameterized Systems: All Flavors of Threshold Automata (Q5009433) (← links)
- Flatness and Complexity of Immediate Observation Petri Nets (Q5089312) (← links)
- The Parikh Property for Weighted Context-Free Grammars (Q5090971) (← links)
- (Q5111264) (← links)
- A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application (Q5166771) (← links)
- Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences (Q5179048) (← links)
- Decidability of Weak Bisimilarity for a Subset of BPA (Q5415622) (← links)
- Timed Basic Parallel Processes (Q5875376) (← links)
- The regular viewpoint on PA-processes (Q5958465) (← links)
- Structural Liveness of Immediate Observation Petri Nets (Q6044494) (← links)
- Unboundedness problems for machines with reversal-bounded counters (Q6091196) (← links)
