The NFA of the language L is shown in the figure over the input ∑={a}. Find the complement of the language L.

A deterministic finite automata with alphabet {a,b} is given below

Which of the following DFA which accepts the same language as the language accepted by the above automata?

Consider the following deterministic finite state automaton where w is the set of seven bit binary strings in which the 1^st, 4^th, and 7^th bits are 1. The number of strings that are accepted by the DFA is

Which of the following are not regular?

(1) Strings of even number of a’s.

(2) Strings of a’s, whose length is a prime number.

(3) Set of all palindromes made up of a’s and b’s.

(4) Strings of a’s whose length is a perfect square

In the given language L={01,00,100}, the strings are in L*

1) 01001000100

2) 000010000

3) 100000100001

4) 100000100

Which of the following set can be recognized by a Deterministic Finite state Automaton?

Which of the following is a not a part of 5-tuple deterministic finite automata

The finite state machine given in figure below recognizes

Given B = {0,1} and L = B*. If R = (0ⁿ 1ⁿ, n > 0) , then language L ∪ R and R are respectively

Consider the finite automaton in the following figure. Which is the set of reachable possible states for the input string 0011?