Q1. A language accepted by an FA is also accepted by
Select correct option:
TG only
GTG only
RE only
All of the given
Q2. Length of EVEN-EVEN language is _________
Select correct option:
Even
Odd
Sometimes even & sometimes odd
Such language doesn’t exist
Q3. [(a + b)(a + b)]*, given RE cannot generate the string ________
Select correct option:
Abbaabab
Abbbaa
Bbbbbb
abbbaaaaa
Q4. Which of the following statement is true about GTG?
Select correct option:
Transition are based on input letter
Transition are based on specified substring
Transition are based on Regular Expression
None of the given options.
Q5. Formal is also known as _________
Select correct option:
Syntactic Language
Semantic language
Informal Language
None of these
Q6. What is false about the term alphabet?
Select correct option:
It is finite set of symbols
It is usually denoted by Greek letter Sigma
It can be an empty set.
Strings are made up of its elements
Q7. The language having even number of a’s and even number of b’s defined over S = {a, b} is called
Select correct option:
EVEN-EVEN
ODD-ODD
PALINDROME
FACTORIAL
Q8. In an FA, when there is no path starting from initial state and ending in final state then that FA
Select correct option:
accept null string
accept all strings
accept all non empty strings
does not accept any string
0 comments
Post a Comment