Automata, Games, and Verification Bernd Finkbeiner



Written: 01.02.2019 11:03 Written By: Bernd Finkbeiner

The correct answer for warm-up question 14.2 is that deterministic Muller tree automata are closed under intersection, but not under union or complement. The issue is that the language of {0, 1}-labeled trees that have (at least) one 1-labeled node is not recognizable by a deterministic Muller tree automaton (see also PS13.2), but its complement is recognizable.

Privacy Policy | Legal Notice
If you encounter technical problems, please contact the administrators