Mottet, AntoineAntoineMottetQuaas, KarinKarinQuaas2022-03-232022-03-232019-0336th International Symposium on Theoretical Aspects of Computer Science (STACS 2019) 126: 53 (2019)http://hdl.handle.net/11420/12085We investigate the complexity of the containment problem “Does L(A) ⊆ L(B) hold?”, where B is an unambiguous register automaton and A is an arbitrary register automaton. We prove that the problem is decidable and give upper bounds on the computational complexity in the general case, and when B is restricted to have a fixed number of registers.enContainment problemData wordsLanguage inclusion problemRegister automataUnambiguous automataConference Paper10.4230/LIPIcs.STACS.2019.53Other