Considering the following finite state automata:
Finite State Automata Image - 1
Model the transition relation using the formula: model = (a → b') ∧ (b → c') ∧ (c → b')
Now, Model as a propositional formula the property that the initial state a cannot be reached from c or b.
I am clear on the steps of propositional logic but the use of a finite automata in this has really thrown me off and as such, I am not sure how to attempt this?
Any help of tips would be greatly appreciated.