The following pages link to Automated Deduction – CADE-20 (Q5394623):
Displaying 22 items.
- Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
- Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach (Q540685) (← links)
- Convergence of Newton's method over commutative semirings (Q899320) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- Parikh's theorem: a simple and direct automaton construction (Q1944966) (← links)
- Reachability relations of timed pushdown automata (Q2221811) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- Parikh’s Theorem and Descriptional Complexity (Q2891382) (← links)
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads (Q3617755) (← links)
- Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case (Q3636822) (← links)
- Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order (Q3646258) (← links)
- (Q5002803) (← links)
- Bounded Context Switching for Valence Systems (Q5009426) (← links)
- (Q5111264) (← links)
- Extending two-variable logic on data trees with order on data values and its automata (Q5410335) (← links)
- A Proof of Parikh’s Theorem via Dickson’s Lemma (Q5859679) (← links)
- Timed Basic Parallel Processes (Q5875376) (← links)
- Model checking parameterized asynchronous shared-memory systems (Q5892422) (← links)
- Succinct ordering and aggregation constraints in algebraic array theories (Q6561348) (← links)
- The complexity of bidirected reachability in valence systems (Q6649456) (← links)
- Reasoning on data words over numeric domains (Q6649469) (← links)
