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

1.1k questions

1.3k answers

1.7k comments

557 users

Most popular tags

vrs vrs_exam vrs_exercise ltl exam ctl dira omega_automata rosy parallel_computing ltl_model_checking mbes processor_architecture zielonka sequent-calculus local-model-checking se1 lo2 automata bdd mu-calculus simplex temporal rosy_exam greatest-simulation zdd2fdd vrs_lecture kripke studiengang_reform bdd2fdd exists-algorithm tool fourier_motzkin equivalance bdd2zdd studiengangswechsel symbolic_computation ctl_model_checking fdd2bdd floating_point_arithmetic snf induction breakpoint simulation zdd curriculum_change fdd2zdd predicate_logic dynamic_scheduling cmd b_complement_multiplication constrain-algorithm compose-algorithm #parallel_computing minic i2sc format robdd 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

Graph Games [closed]

0 votes
Hello,

so, we had a graph game with 2 different nodes of the highest number. These two nodes had different shapes (=different player). Who will begin the game? How to choose if i = 0 or 1?

Thanks
closed with the note: answered
in * TF "Dist. and Com. Sys." by (120 points)
closed by

Related questions

0 votes
1 answer
Parity Game with dead end
asked Aug 28 in * TF "Emb. Sys. and Rob." by amreen_siraj (200 points)
0 votes
1 answer
Zielonka - Practice Questions
asked Feb 11, 2023 in # Study-Organisation (Master) by Pavithra rani (850 points)
 | Snow Theme by Q2A Market
Powered by Question2Answer
Imprint | Privacy Policy
...