Classical

Theory Of Computation MCQ - Regular languages and finite automata

11:  

In an incompletely specified automata

A. no edge should be labelled epsilon
B. from any given state, there can't be any token leading to two different states
C. both (a) and (b)
D. start state may not be there
 
 

Option: D

Explanation :


12:  

If  f : {a, b}* —> (a, b}* be given by f (n) = ax for every value of n  ∈ (a, b}, then f is

A.

one to one not onto

B.

one to one and onto

C.

not one to one and not onto

D.

not one to one and onto

 
 

Option: A

Explanation :


13:  

 The word 'formal' in formal languages means

A. the symbols used have well-defined meaning
B. they are unnecessary, in reality
C. only form of the string of symbols is significant
D. Both (a) and (b)
 
 

Option: C

Explanation :


14:  

 Running time of NFA to DFA conversion including the case where NFA has e-transition is

A.

0 (n3)

B.

0 (n332)

C.

0 (n32n)

D.

0 (n22n)

 
 

Option: C

Explanation :


15:  

Which of the following statements is/are false ?

A. The task of lexical analyzer is to translate the input source language text into tokens and determine the groups of tokens are inter-related.
B. Two basic approaches to translation are generation and interpretation.
C. A load-and-go compiler is capable o translating the source language text on a host machine A that can be later run on any target machine B.
D. None of these
 
 

Option: D

Explanation :




Suggest an improvement