Volltext
Prof Roland Meyer TU Braunschweig
Dr. Prakash Saivasan Summer term 2017
Out: Apr 18 Due: Apr 24, 12:00
Exercise 1: Ehrenfeucht-Fra¨ıss´e Games
Letn ∈Nbe arbitrary. Which is the maximal number of roundsk ∈Nsuch that the duplicator has a winning strategy for Gk((ab)2n+1,(ba)2n+1) ?
Hint: First see what happens for n= 1 and n= 2.
Exercise 2: More Ehrenfeucht-Fr¨a´ısse Games
Letn∈N be arbitrary. For which k does the Duplicator win Gk(anban, anban+1)?
ÄHNLICHE DOKUMENTE
c) Prove using structural induction that every star-free language
Because of the holiday on Monday, you can bring your submissions to the exercise class
Adapting Parikh’s proof, show that reachability in counter machines with one unrestricted counter and n r-reversal bounded counters
The words in the language will however respect the actions on the unrestricted counter because they correspond to actual effects on the counter of M 00 , which can make sure we
The idea is to accept a run if the set of states that occur infinitely often matches one of the Q i
b) Büchi’s theorem (I) can be adapted to show that every NBA-definable language is S1S- definable. Illustrate the main ingredients needed to adapt Büchi’s proof.. c) Büchi’s
Let | = fin be the satisfaction relation between finite words and LTL[ , U , < , S] formulas, de- fined exactly as the | = relation but only considering positions of the word
Use the construction presented in class to decorate the tree with a strategy for player P.. Exercise 4: Complementation of
