February 17, 2021 Problem 6b

1) In acceptence condition I get GF(q0 -> b) & GF(q1 | b) but in the solution it is GF(b | q1) only. Is it related to fairness constraint? Can you please explain.

2) Can you please show me the TT of transition ¬q0 & ¬q1 & a & ¬b & ¬q0' & ¬q1' or any other method to quickly draw the kripke structure ?

Sept 2022 Problem 6a

3) Can you please show me the truth table for p,q,pq,{}

3.1. where p=0 and q =1. I m landing at (p' <-> a) & (!b & q). I am getting a transition from s1 to s2 on giving input 'a' (considering p' <-> a).

3.2 where p=1 and q=0. I m landing at (p')&(!(!b&q)) = p'&(b|q). I m confused with drawing the transistion for p'&(b|q).

I hope once these questions are explained we will reach a good clarity.