TOC_Q1

Front

The DFA shown accepts the set of all strings over {0, 1} that

Back

End with 00

Front

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

Back

All of the mentioned

Front

A DFA cannot be represented in the following format: Transition graph, Transition table, C Code, None of the mentioned.

Back

None of the mentioned

Front

Mapping Function of a DFA

Back

Q * Σ -> Q

Front

Languages of an automata is

Back

If it is accepted by automata

Front

Finite automata requires minimum _______ number of stacks.

Back

0

Front

The basic limitation of finite automata is that

Back

It can’t remember arbitrary large amount of information., no memory

Front

NFA, in its name has 'non-deterministic' because of:

Back

The choice of path is non-deterministic

Front

Back

x is a string such that it ends with ‘101’

Front

Back

{w | w contains 010 as a substring}