Concept drill
complementation
GATE CSE & IT · Turing Machines & Computability · 1990-2005
3
PYQs
100%
keyed
0
elite explanations
3
years appeared
Study anchor
Hopcroft-Ullman / Dragon Book
Automata, languages, parsing, syntax-directed translation
Practice action
Start latest PYQPYQs in this concept
All concepts →2005 PYQ
Let $${L_1}$$ be a recursive language, and Let $${L_2}$$ be a recursively enumerable but not a recursive language. Which one of the following is TRUE?
easyanswer key
1999 PYQ
If $${L_1}$$ is a context free language and $${L_2}$$ is a regular which of the following is/are false?
easyanswer key
1990 PYQ
Let $${R_1}$$ and $${R_2}$$ be regular sets defined over the alphabet $$\sum \, $$ then:
easyanswer key