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

1.1k questions

1.2k answers

1.6k comments

529 users

0 votes

Shouldn't this be less than equal to (<=) because we are talking about previous operator?  So, for t1: 0<= t1 <= t0 and for t0 : t0>0

Exam paper: question 9)(d)

https://es.cs.uni-kl.de/teaching/vrs/exams/2017.08.29.vrs/2017.08.29.vrs.solutions.pdf

in * TF "Vis. and Sci. Comp." by (870 points)

1 Answer

0 votes
No, we are just talking about GFa in the final step since we have replaced GF PWX a by the equivalent formula GFa first.
by (166k points)
If in the exam I don't replace GF PWX a by GF a and write LO2 form for GF PWXa will it be accepted?
Sure, as it will also be correct.
Imprint | Privacy Policy
...