Lorenzo Clemente ; Sławomir Lasota ; Radosław Piórkowski - Determinisability of register and timed automata

lmcs:7345 - Logical Methods in Computer Science, May 10, 2022, Volume 18, Issue 2 - https://doi.org/10.46298/lmcs-18(2:9)2022
Determinisability of register and timed automata

Authors: 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 decidability/complexity landscape of the deterministic membership problem, in the setting of both register and timed automata. For register automata, we prove that the deterministic membership problem is decidable when the input automaton is a nondeterministic one-register automaton (possibly with epsilon transitions) and the number of registers of the output deterministic register automaton is fixed. This is optimal: We show that in all the other cases the problem is undecidable, i.e., when either (1) the input nondeterministic automaton has two registers or more (even without epsilon transitions), or (2) it uses guessing, or (3) the number of registers of the output deterministic automaton is not fixed. The landscape for timed automata follows a similar pattern. We show that the problem is decidable when the input automaton is a one-clock nondeterministic timed automaton without epsilon transitions and the number of clocks of the output deterministic timed automaton is fixed. Again, this is optimal: We show that the problem in all the other cases is undecidable, i.e., when either (1) the input nondeterministic timed automaton has two clocks or more, or (2) it uses epsilon transitions, or (3) the number of clocks of the output deterministic automaton is not fixed.


Volume: Volume 18, Issue 2
Published on: May 10, 2022
Accepted on: December 15, 2021
Submitted on: April 9, 2021
Keywords: Computer Science - Formal Languages and Automata Theory


Share

Consultation statistics

This page has been seen 426 times.
This article's PDF has been downloaded 643 times.