The Graph above is the answer from the automata. I have problem to determine some of those transitions. I used a truth table to dertermine which the trasitions. This way works well for other Klausur examples.

p | q | ϕR | |

0 | 0 | !(b | a & next(p)) | |

0 | 1 | !(b | a & next(p)) & next(q) | |

1 | 0 | b | a & next(p) & !next(q) | |

1 | 1 | b | a & next(p) & next(q) | |

How are we getting the transitions ({p,q}, b , {q}) ; ({p}, b , {}) ; ({}, !b ,{}) ; ({}, !b ,{q}) ?