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

974 questions

1.1k answers


472 users

0 votes

could you please explain why in problem 7 sep 2022 in the equation  true  has been written?in some solution instead of true some thing like GF[something-->somethimg] has written

A {p, q}, q,(p <-->b |a & Xp) & (q <-> p&Xq),true)

in # Study-Organisation (Master) by (170 points)

1 Answer

0 votes
An omega automaton accepts an infinite word, if (1) there is an infinite run through the automaton, and (2) that run satisfies the acceptance condition. If the acceptance condition is simply true, then it is enough that the word has an infinite run through the automaton. That kind of omega-automaton essentially belongs to every class of nondeterministic automata, and we may consider it also as a safety automaton so that the subset construction can be used for its determinization.
by (148k points)

Related questions

Imprint | Privacy Policy