NFA Vs DFA

Front

δ(A,1)=B, δ(A,0)=A, δ(B,0)=C, δ(B,1)=C, δ(C,0)=A, Initial state=A. String='011001' final state?

Back

c) B

Front

Languages of an automata

Back

Accepted by automata

Front

Basic limitation of finite automata:

Back

It can’t remember arbitrary amount of information.

Front

Finite automata can't recognize L={equal number of a's and b's} over {a,b} due to:

Back

Not having any auxiliary memory.

Front

Causes state changes in an automaton.

Back

Input

Front

A DFA can be represented as:

Back

Transition table

Front

NFA has 'non-deterministic' due to:

Back

The choice of path is non-deterministic.

Front

A language is regular if and only if it is accepted by finite automata.

Back

The statement is true.

Front

Finite automata recognizes:

Back

Regular Language

Front

5-tuple FA = {Q, ∑, δ, q, F}. Statement 1: q ϵ ∑; Statement 2: FϵQ.

Back

Statement 1 is false, Statement 2 is true.