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


538 users

0 votes

a similar question has been asked before (, but I have a doubt about the solution suggested.
Since a universal automaton is given in the exam question, afaik we need to transform it to a negated existential one first, which includes negating the acceptance condition. With this, my solution looks as in the picture below.
I would appreciate it if you could verify this.

in * TF "Emb. Sys. and Rob." by (170 points)

1 Answer

+1 vote
Your computation is correct, as far as I can say. However, to translate the automaton formula, you don't have to double negate it to get an existential automaton inside. If you drive in the outermost negation, it is still a LO2 formula, and is the one obtained directly from the universal automaton.
by (166k points)

Related questions

0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
asked Aug 23, 2022 in * TF "Emb. Sys. and Rob." by CS_E (2.9k points)
Imprint | Privacy Policy