Concept drill
computability
GATE CSE & IT · Turing Machines & Computability · 1992-2003
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 →2003 PYQ
If the strings of a language $$L$$ can be effectively enumerated in lexicographic (i.e., alphabetic$$(c)$$ order, which of the following statements is true?
mediumanswer key
1994 PYQ
Which of the following conversions is not possible (algorithmically)?
easyanswer key
1992 PYQ
Which of the following statements is / are true / false? Union of two recursive languages is recursive
easyanswer key