Mottet, AntoineAntoineMottetQuaas, KarinKarinQuaas2022-03-222022-03-222021-05Theory of Computing Systems 65 (4): 706-735 (2021-05)http://hdl.handle.net/11420/12082We investigate the complexity of the containment problem “Does L(A) ⊆ L(B) hold?” for register automata and timed automata, where B is assumed to be unambiguous and A is arbitrary. We prove that the problem is decidable in the case of register automata over (ℕ, =) , in the case of register automata over (ℚ, <) when B has a single register, and in the case of timed automata when B has a single clock. We give a 2-EXPSPACE algorithm in the first case, whose complexity is a single exponential in the case that B has a bounded number of registers. In the other cases, we give an EXPSPACE algorithm.en1433-049020214706735ContainmentRegister automataTimed automataUnambiguous automataJournal Article10.1007/s00224-020-09997-2Other