Automated Deduction – CADE-20

DOI10.1007/11532231zbMath1135.94331OpenAlexW2485416161MaRDI QIDQ5394623

Helmut Seidl, Thomas Schwentick, Kumar Neeraj Verma

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11532231

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Parikh’s Theorem and Descriptional Complexity ⋮ Alternating two-way AC-tree automata ⋮ Context-free commutative grammars with integer counters and resets ⋮ Visibly pushdown transducers ⋮ Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata ⋮ Unboundedness problems for machines with reversal-bounded counters ⋮ Convergence of Newton's method over commutative semirings ⋮ Unnamed Item ⋮ Parikh's theorem: a simple and direct automaton construction ⋮ Model checking parameterized asynchronous shared-memory systems ⋮ Reachability relations of timed pushdown automata ⋮ Timed Basic Parallel Processes ⋮ Bounded Context Switching for Valence Systems ⋮ Extending two-variable logic on data trees with order on data values and its automata ⋮ Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach ⋮ Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads ⋮ Unnamed Item ⋮ Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case ⋮ Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order ⋮ A Proof of Parikh’s Theorem via Dickson’s Lemma