retagged by
488 views

1 Answer

0 votes
0 votes
State is Amiguously defined if we have more than one transitions for a given string from a given state

now  make a table and for x=0,y=0,z=0 and try transitions from state A,B,C

Then for x=0,y=0,z=1 try the same thing...

then for x=0 y=1 z=0 try the same thing...

till x=1,y=1,z=1

at x=1 y=1 z=1 you will see C has two transitions A and B

Thus C is defined unambiguous

rest for all states transitions for all strings applied on states will be maximum 1

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
1 answer
2
Priyankalora asked Jul 30, 2023
901 views
Find the complement of the following Boolean functions and reduce them to a minimum number of literalsa) (BC'+A'D)(AB'+CD')b)B'D+A'BC'+ACD+A'BCc)[(AB)'A][(AB)'B]d)AB'+C'D...
4 votes
4 votes
1 answer
3
AniMan_7 asked Jun 29, 2023
1,142 views
Does EX-NOR Gate follow Associativity ?How 3 input EX-NOR function is equal to 3 input EX-OR function ?