EASY
LIC Assistant Mains
IMPORTANT
Earn 100

The word 'formal' in formal languages means:

50% studentsanswered this correctly

Important Questions on Automata Theory

EASY
LIC Assistant Mains
IMPORTANT
Pumping lemma is generally used for proving:
HARD
LIC Assistant Mains
IMPORTANT

Which of the following definitions generates the same language as L, where

L=xnyn,n1?

I .ExEy | xy

II. x y | + x +y y+

x+y+

EASY
LIC Assistant Mains
IMPORTANT
The number of internal states of a UTM should be at least:
MEDIUM
LIC Assistant Mains
IMPORTANT

Choose the correct statements:

MEDIUM
LIC Assistant Mains
IMPORTANT
Choose the correct statements:
MEDIUM
LIC Assistant Mains
IMPORTANT
Which of the following conversion is not possible algorithmically?
HARD
LIC Assistant Mains
IMPORTANT

The set {anbn | n=1,2,3,!} can be generated by the CFG:

HARD
LIC Assistant Mains
IMPORTANT
For which of the following applications regular expressions can't be used?