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

912 questions

1k answers

1.4k comments

441 users

0 votes

Could you please guide me how I should solve this kind of question? How should I start?

in * TF "Emb. Sys. and Rob." by (1.7k points)
Option 1: Understand how the accepted paths look like. Think about how these paths can be detected.

Option 2: Study the section on Boolean operations on automata and the section on determination. https://es.cs.uni-kl.de/teaching/vrs/slides/VRS-06-OmegaAutomata-1.pdf

1 Answer

+1 vote
Well, it's not important that we ask for G¬b, the bigger question behind is whether a property G(p) can be expressed by a deterministic FG automaton. Such questions are discussed in a section of the chapter on omega-automata, and that particular question is answered on slide 60. There you simply find the answer and the omega-automaton mentioned here. So, here it is not a algorithm learned, here it is that theorem/formula/example which should be remembered.
by (142k points)

Related questions

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