2 results
Lorenzo Clemente ; Richard Mayr.
We present efficient algorithms to reduce the size of nondeterministic B\"uchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages. Additionally, we describe methods to solve PSPACE-complete automata problems like language universality, equivalence, […]
Published on February 13, 2019
Lorenzo Clemente ; Sławomir Lasota ; Radosław Piórkowski.
The deterministic membership problem for timed automata asks whether the timed language given by a nondeterministic timed automaton can be recognised by a deterministic timed automaton. An analogous problem can be stated in the setting of register automata. We draw the complete […]
Published on May 10, 2022