The following pages link to (Q4535007):
Displaying 11 items.
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Invariants and closures in the theory of rewrite systems (Q1815344) (← links)
- Iterating transducers (Q1858440) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
- Taming the infinite: Verification of infinite-state reactive systems by finitary means (Q2767987) (← links)
- Rewriting systems over nested data words (Q2917309) (← links)
- Monotonic Abstraction for Programs with Dynamic Memory Heaps (Q3512503) (← links)
- (Q3746904) (← links)
- Automated Technology for Verification and Analysis (Q5394170) (← links)