HARD
LIC Assistant Mains
IMPORTANT
Earn 100

For which of the following applications regular expressions can't be used?

50% studentsanswered this correctly

Important Questions on Automata Theory

HARD
LIC Assistant Mains
IMPORTANT
Objective Computer Awareness>Chapter 14 - Automata Theory>Automata Theory>Q 59

The FSM pictured in Fig. is a:

Question Image

HARD
LIC Assistant Mains
IMPORTANT
Objective Computer Awareness>Chapter 14 - Automata Theory>Automata Theory>Q 60
The above machine:
MEDIUM
LIC Assistant Mains
IMPORTANT
Objective Computer Awareness>Chapter 14 - Automata Theory>Automata Theory>Q 61
Pick the correct statements.The logic of the Pumping lemma is a good example of:
MEDIUM
LIC Assistant Mains
IMPORTANT
Objective Computer Awareness>Chapter 14 - Automata Theory>Automata Theory>Q 62
The vernacular language English, if considered a formal language is a:
HARD
LIC Assistant Mains
IMPORTANT
Objective Computer Awareness>Chapter 14 - Automata Theory>Automata Theory>Q 63

Pick the correct answers.
Universal TM influenced the concept of:

MEDIUM
LIC Assistant Mains
IMPORTANT
Objective Computer Awareness>Chapter 14 - Automata Theory>Automata Theory>Q 64
Bounded minimalization is a technique for?
HARD
LIC Assistant Mains
IMPORTANT
Objective Computer Awareness>Chapter 14 - Automata Theory>Automata Theory>Q 65
A PDM behaves like an FSM when the number of auxiliary memory it has is:
HARD
LIC Assistant Mains
IMPORTANT
Objective Computer Awareness>Chapter 14 - Automata Theory>Automata Theory>Q 66
Which of the following CFG's can't be simulated by an FSM?