We introduce a new paradigm for analysing and finding bugs in quantum circuits. In our
approach, the problem is given by a ‍triple {P} C {Q} and the question is whether, given a set …

We improve on an existing [PA Abdulla, J. Högberg, L. Kaati, Bisimulation minimization of
tree automata, International Journal of Foundations of Computer Science 18 (4)(2007) 699 …

We present a new method for the verification of quantum circuits based on a novel symbolic
representation of sets of quantum states using level-synchronized tree automata (LSTAs) …

Automata learning is a technique that has successfully been applied in verification, with the
automaton type varying depending on the application domain. Adaptations of automata …

We improve an existing bisimulation minimisation algorithm for tree automata by introducing
backward and forward bisimulations and developing minimisation algorithms for them …

We introduce a new paradigm for analysing and finding bugs in quantum circuits. In our
approach, the problem is given by a triple $\{P\}\, C\,\{Q\} $ and the question is whether …

We study a categorical generalisation of tree automata, as $\Sigma $-algebras for a fixed
endofunctor $\Sigma $ endowed with initial and final states. Under mild assumptions about …

We present a new method for the verification of quantum circuits based on a novel symbolic
representation of sets of quantum states using level-synchronized tree automata (LSTAs) …

Several models of automata are available that operate unranked trees. Two well-known
examples are the stepwise unranked tree automaton (suta) and the parallel unranked tree …

Combinatorial filters are formal structures for filtering and reasoning over discrete sensor
data. This article presents a series of results addressing the question whether the filter …