TOC QUIZ 28-08

A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages using the operation

• Union

• Concatenation

• Kleene*

• All of the mentioned

Statement 1: A Finite automata can be represented graphically;

Statement 2: The nodes can be its states;

Statement 3: The edges or arcs can be used for transitions

• Statement 1 is false but Statement 2 and 3 are correct

• Statement 1 and 2 are correct while 3 is wrong

• None of the mentioned statements are correct

• All of the mentioned

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

• Input alphabet

• Transition function

• Initial State

• Output Alphabet

There are ________ tuples in finite state machine.

• 4

• 5

• 6

• unlimited

Language of finite automata is.

• Type 0

• Type 1

• Type 2

• Type 3

If NFA of 6 states excluding the initial state is converted into DFA, maximum possible number of states for the DFA is ?

• 64

• 32

• 128

• 127

The given NFA corresponds to which of the following Regular expressions?

• (0+1) (00+11) (0+1)

• (0+1) (00+11) (0+1) *

• (0+1) *(00+11) (0+1)

• (0+1) (00+11) (0+1) *

Concatenation Operation refers to which of the following set operations:

• Union

• Dot

• Kleene

In order to represent a regular expression, the first step to create the transition diagram is:

• Create the NFA using Null moves

• Null moves are not acceptable, thus should not be used

• Predict the number of states to be used in order to construct the Regular expression

The minimum number of states required to automate the following Regular Expression: (1) (01+10) (1)

• 4

• 3

• 2

• 5