1 citations · 1 across the 3 of their papers we have counts for
3 papers · 1 filter
Pushdown Model Checking Above the Cubic Bottleneck
A. R. Balasubramanian, Dmitry Chistikov, Rupak Majumdar
Many problems in the verification of recursive programs can be reduced to pushdown model checking. In this problem, we are given as input a pushdown automaton (PDA) over a constant…
Algorithms and fine-grained complexity for nondeterministic and symmetric difference automata
Dmitry Chistikov, Radosław Piórkowski, Neha Rino +1
Symmetric difference automata (XNFA) are a variant of standard finite automata in which an input word is accepted iff the number of accepting runs is odd. Equivalently, these are w…
Intersecting Dense Automata
Dmitry Chistikov, Neha Rino
We observe that the classical Cartesian product construction for the intersection of (languages of) nondeterministic finite automata (NFA) is non-optimal in the worst case, if the…