## Objective Questions

*Question*

A regular language can be:

- irregular
- infinite
- non-deterministic
- None of the given options

Answer: 2 | Chapter No. |

*Question*

All possible combinations of strings of a language including null string is referred as:

- Concatenation of a language with itself
- Kleene star closure of a language
- Multiplication of a language with itself
- Addition of a language with itself

Answer: 2 | Chapter No. |

*Question*

We cannot construct an NFA for the language of ______ defined over alphabet set {a,b}.

- Even even
- Odd
- Palindromes
- Integers

Answer: | Chapter No. |

*Question*

The minimum length of the strings(except null string) of a language that starts and ends in different letters will be

- 1
- 2
- 3
- 4

Answer: 2 | Chapter No. |

*Question*

For every three regular expressions R, S, and T, the languages denoted by R(S U T) and (RS) U (RT) are the ________.

- Same
- Different
- R(S U T) is Greater
- None of the given options

Answer: | Chapter No. |

*Question*

There ______ a language for which only FA can be built but not the RE.

- is
- cannot be
- may be
- may not be

Answer: | Chapter No. |

*Question*

The language {a ab aba bab} is ________.

- Irregular
- Regular
- Recursive
- None of the given options

Answer: | Chapter No. |

*Question*

If R is a regular language and L is some language, and L U R is a _______, then L must be a ________.

- Regular language
- Finite Automaton
- NFA
- Irregular language

Answer: | Chapter No. |

*Question*

In _______ there must be transition for all the letters of a string.

- NFA
- GTG
- TG
- FA

Answer: | Chapter No. |

*Question*

If we have a finite language and the number of states in the FA is n then the maximum number of letters in the each word of the language that will be accepted by the given FA will be:

- 1
- n-1
- n+1
- n

Answer: | Chapter No. |

*Question*

A string will be accepted by an NFA if there exist _______one successful path.

- atmost
- atleast
- maximum
- none of the given options

Answer: | Chapter No. |

*Question*

Let FA3 be an FA corresponding to FA1FA2, then the initial state of FA3 must correspond to the initial state of

- FA1 only
- FA2 only
- FA1 or FA2
- FA1 and FA2

Answer: | Chapter No. |

*Question*

Decomposing a string into its valid units is referred as:

- Decomposing
- Splitting
- Tokenizing
- Dividing

Answer: | Chapter No. |

*Question*

FA and _______ are same except that _______ has unique symbol for each transition.

- FA,TG
- NFA,TG
- NFA,FA
- GTG,NFA

Answer: | Chapter No. |