Automata, Games, and Verification Bernd Finkbeiner


Example for WQ6.6

Written: 30.11.2018 11:34 Written By: Bernd Finkbeiner

Regarding today's warm-up questions, if you were wondering about an example for a non-counting language that is not Büchi-recognizable (Question 6), here is one: L = { α∈(ab*)ω | α=abn0abn1... such that for all i there is a j>i such that nj>ni }.

Have a great weekend,
the Automata, Games, and Verification Team


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