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

Most popular tags

vrs vrs_exam vrs_exercise ltl ctl exam dira omega_automata rosy parallel_computing ltl_model_checking mbes processor_architecture zielonka se1 lo2 automata bdd mu-calculus sequent-calculus simplex temporal local-model-checking kripke studiengang_reform rosy_exam zdd2fdd vrs_lecture greatest-simulation bdd2fdd exists-algorithm fourier_motzkin equivalance bdd2zdd tool studiengangswechsel fdd2bdd floating_point_arithmetic snf induction simulation zdd curriculum_change symbolic_computation fdd2zdd ctl_model_checking predicate_logic dynamic_scheduling cmd b_complement_multiplication constrain-algorithm compose-algorithm #parallel_computing minic i2sc format robdd breakpoint acceptance curriculum_update basic_block_scheduling unit-tests finroc sche ddd2zdd zdd2bdd vrs_cheatsheet hrs infinite_path branch-bound pre-requisite thesis functional state-machine uml-diagram embedded-system ml1 registration pipeline_conflicts vector_computers actiontable modulo_scheduling static_scheduling organisation lo1 conditional #pram restrict ite programming compiler abacus scheduling parallel forall notation shannon important predecessors fdd

Categories

Problem 7 sep 2022

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 (166k points)

Related questions

+7 votes
1 answer
Prob 6 NDet FG (SEP 2022) breakpoint construction
asked Feb 10, 2023 in * TF "Emb. Sys. and Rob." by pjose (200 points)
0 votes
1 answer
Prob 6 NDet FG (SEP 2022)
asked Feb 10, 2023 in # Study-Organisation (Master) by Sefidi (170 points)
0 votes
0 answers
Study Group for VRS Exam Sep 2022
asked Jul 22, 2022 in * TF "Emb. Sys. and Rob." by balachan (120 points)
0 votes
1 answer
CTL, LTL, CTL* [02.2022 7a]
asked Feb 6, 2023 in * TF "Emb. Sys. and Rob." by learner (660 points)
 | Snow Theme by Q2A Market
Powered by Question2Answer
Imprint | Privacy Policy
...