Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

868 questions

986 answers

1.4k comments

438 users

0 votes

 FSM:    where 

 Vin={a} V i n = { a } , Vout={o} , Vstate={p,q} , I = p ∨ q ,  R = next(p)|o&a&!q<->next(q)<->p

How can I compute the existential predecessors of p<->!q? And How the left associativity is distributed among relation R [ Is it the right way to give brackets " ((next(p)|(o&a&!q))<->(next(q))<->p)"  ? ] 

in # Study-Organisation (Master) by (1.1k points)
edited by

1 Answer

+1 vote
 
Best answer

See slides 67-71 of chapter 4 (transition systems for the explanations of the symbolic predecessor and successor computations. Also, the teaching tool on  https://es.cs.uni-kl.de/tools/teaching/SymbolicStateTrans.html can help you to check your computations. For the above example, it computes

∃next(p).∃next(q).(next(p)|o&a&!q<->next(q)<->p)&(next(p)<->!next(q))
  = ∃next(q).!next(q)&(p<->next(q))|(p<->!q&a&o<->next(q))&next(q)
  = !p|(p<->!q&a&o)
by (139k points)
selected by
Thank you, Professor. I solved it.

Related questions

0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
Imprint | Privacy Policy
...