retagged by
594 views

2 Answers

2 votes
2 votes

for example ,let us take  9 a's & 5 b's

(D)

9 mod 3 >5 mod 3 =>  0>2 (false -Not accepted)

(E)

9-5=4 => 4 mod 3 =1 =>1> 0 (true -accepted)

another example  ,let us take 5 a's & 9 b's

(D)

5 mod 3 >9 mod 3 =>  2>0 (true -accepted)

(E)

5-9=-4 => -4 mod 3 = -1 => -1>0(false-Not accepted)

language  (E) is different from (D)

correct me if I am wrong!!

edited by
0 votes
0 votes
Both are equivalent language.

Related questions

0 votes
0 votes
1 answer
1
Vicky rix asked Apr 2, 2017
1,371 views
Find dfa's for the following languages on Σ = {a,b}.L= {w: na(w) mod 3 >nb(w) mod 3}.L= {w :(na(w) – nb(w)) mod 3 0}.
1 votes
1 votes
2 answers
2
akankshadewangan24 asked Jun 26, 2017
651 views
contruct the PDA for CFG L={set of balanced paranthesis}