Digital Logic

Materials for GATE preparation in Digital Logic

39,750 total views, 4 views today

L1= {⟨M⟩| M is a TM and M does not accept all even numbers}. L2= {⟨M⟩| M is a TM and M accept all [...]

Nlogk will be ans [...]

Epsilon closure is a set of states that a particular automata state can reach only on the transition [...]

Tokens generated in C are=> main ( ) { in t gate ; } total 9 [...]

LL(0) grammars have no lookahead. And since they follow Leftmost derivation, at each step the parser [...]

Since LR(0) parser places reduce-moves in the entire row of "Action", having anything more [...]

Opt A [...]

$A=Plays\ Badminton\ and\ husband\ of\ E\ (दादा)$ $B=Plays\ Carrom\ and\ daughter-in-law\ of\ E\ and [...]

$\\A=Plays\ Badminton\ and\ husband\ of\ E\ (दादा)\\ B=Plays\ Carrom\ and\ daughter-in-law\ of\ E\ a [...]

$\\A=Plays\ Badminton\ and\ husband\ of\ E\ (दादा)\\ B=Plays\ Carrom\ and\ daughter-in-law\ of\ E\ a [...]

$\\STABILISE=UVCDKNKUG\\ \\S \overset{T}{\rightarrow} U \\T \overset{U}{\rightarrow} V \\A \overset{ [...]

$2\ 3\ {\color{Blue} 9}\ 5\ 1\ 3\ {\color{Blue} 9}\ 6\ 7\ 3\ 9\ 4\ 8\ 9\ 3\ 4\ 9\ 3\ 2\ 3\ {\color{B [...]

%d bloggers like this:

Skip links