Compiler Design
Finite Automata
Q.

For every DFA, there is a ε-NFA that accepts the same language
A.  

True

 B.  

False

 C.  

May be

 D.  

Can't say
Similar Questions
1.

In finite automata, Q stands for?
A.  

Finite set of input symbols

 B.  

Transition function

 C.  

Finite set of states

 D.  

One Start state
2.

Final state is represented by?
A.  

Square

 B.  

Circle

 C.  

Double Circlue

 D.  

Rhombus
3.

_________ of FA are represented by circles
A.  

States

 B.  

Start state

 C.  

Intermediate states

 D.  

Transition
4.

How many arrow does intermediate states have?
A.  

1

 B.  

2

 C.  

3

 D.  

4
5.

In Final state, The number of odd arrows are one greater than even, i.e. odd = even+1?
A.  

TRUE

 B.  

FALSE

 C.  

Can be true or false

 D.  

Can not say
6.

There are ________ tuples in finite state machine
A.  

3

 B.  

4

 C.  

5

 D.  

6
7.

Number of states require to accept string ends with 10.
A.  

0

 B.  

1

 C.  

2

 D.  

3
8.

Languages of a automata is
A.  

If it halts

 B.  

If it is accepted by automata

 C.  

If automata touch final state in its life time

 D.  

All language are language of automata
9.

Language of finite automata is
A.  

Type 0

 B.  

Type 1

 C.  

Type 2

 D.  

Type 3
10.

The basic limitation of finite automata is that
A.  

it can’t remember arbitrary large amount of information

 B.  

it sometimes recognize grammar that are not regular

 C.  

it sometimes fails to recognize regular grammar

 D.  

None of the above
COMPILER DESIGN TOPICS