LIPIcs.STACS.2019.53.pdf
- Filesize: 0.55 MB
- 15 pages
We investigate the complexity of the containment problem "Does L(A)subseteq 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.
Feedback for Dagstuhl Publishing