The following pages link to Term Rewriting and Applications (Q5703871):
Displaying 12 items.
- Rigid tree automata and applications (Q553317) (← links)
- Equational approximations for tree automata completion (Q968530) (← links)
- A note on partially ordered tree automata (Q975463) (← links)
- Verifying parallel programs with dynamic communication structures (Q1959654) (← links)
- One-variable context-free hedge automata (Q2424690) (← links)
- On Symbolic Verification of Weakly Extended PAD (Q2866343) (← links)
- When Is Reachability Intrinsically Decidable? (Q3533013) (← links)
- On the Reachability Analysis of Acyclic Networks of Pushdown Systems (Q3541030) (← links)
- Rigid Tree Automata (Q3618602) (← links)
- Verifying Parallel Programs with Dynamic Communication Structures (Q3637351) (← links)
- Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism (Q5179049) (← links)
- Verifying Multithreaded Recursive Programs with Integer Variables (Q5179057) (← links)
