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

870 questions

988 answers

1.4k comments

439 users

+1 vote

I have a question regarding the following example:

I tried to solve it in the same way shown in the lecture video (https://es.cs.uni-kl.de/teaching/vrs/videos/VRS-04-Transitionsystems-3.html 1:08:00):

However, this does not lead to the right answer (right answer is seen above).

I also used the Tool:

I quess that one could also rephrase my question into: "Why is there no transition from the state (p,a) to itself"?

IMO there should be one since p and p' would be satiesfied and therefore (next(p)|next(q)->a&!(o->q))&p would be true.

in * TF "Emb. Sys. and Rob." by (1.7k points)
I have the exact same problem

1 Answer

+1 vote
 
Best answer

Recall the precedence rules of the propositional operators: 

Thus, disjunction binds stronger than implication.

by (139k points)
selected by
Imprint | Privacy Policy
...