2 votes
1 answer
1
what is the hierarchy of computational power of different automata? thanks in advance
3 votes
2 answers
2
how to determine that this is not in DCFL and also for the odd length palindrome language as well,
1 votes
1 answer
3
L = {a^nb^m : n >= m+3}below context grammer is correct??S == aA | AaA == aAb | bAa | abA | baA | aa