edited by
799 views
1 votes
1 votes

Consider a Game played be between two players (Player-1, Player-2) repeatedly flip a coin.
On output as a head, Player-1 get a point
On output as a tail, Player-2 get a point
A player wins if his score reaches 2 points before the other player by reaching final state. Which of the following depicts NFA for above problem? 

Can anyone explain how this diagram is working between two players,,,,please?????

edited by

1 Answer

0 votes
0 votes
The game would finish as soon as we get two consecutive heads or tails/

If after getting a head we get a tail, we are one step away from finishing the game. So we move to that state, in the downward direction.

We can extend this logic to the time when we get one tail and after that, we get a head.

Related questions

0 votes
0 votes
2 answers
1
prisonmatch asked Jan 6, 2019
1,219 views
How may Moore/Mealy m/c are possible with two states X & Y for the input alphabet {a, b} and output alphabet {0, 1} , where x is always the initial state?
0 votes
0 votes
2 answers
2
jhaanuj2108 asked Sep 26, 2018
640 views
The difference between the number of states in minimal DFA and minimal NFA, which accepts all strings end with 3rd bit as b is _____. [ Assume $\sum$ = {a,b} ]
0 votes
0 votes
1 answer
3
jhaanuj2108 asked Sep 26, 2018
697 views
Consider the following DFA: The number of distinct sets present in all partitions while converting given DFA into minimal DFA using Myhill-Nerode theorem is ________.