retagged by
211 views
1 votes
1 votes
Is equivalence problem decidable in case of-:

1) CFG's

2) DCFG's

If yes, then how?
retagged by

Please log in or register to answer this question.

Related questions

3 votes
3 votes
2 answers
1
0 votes
0 votes
0 answers
2
jatin khachane 1 asked Oct 14, 2018
301 views
L = { w ∈ {a,b}* : a(w) = b(w) }We're using the notation:a(w) = number of a's in a string w b(w) = number of b's in a string w S⇾ aSbS | bSaS | ε Doubt:Is the same l...
1 votes
1 votes
1 answer
3
aditi19 asked Mar 7, 2019
823 views
what is the CFG for the language L=w where number of a’s in w+number of b’s in w=number of c’s in whow to approach this?
0 votes
0 votes
1 answer
4
aditi19 asked Mar 2, 2019
779 views
S->A | BA→ εB->aBbB->bwhat is the complement of the language of this grammar?