Unit 4 - Regular Languages And Finite Automaton Quiz

In DFSA, ε transition may be present

In NDFSA, ε transitions may be present

In DFSA, from any given state, there can't be any alphabet leading to two diferent states

In NDFSA, from any given state, there can't be any alphabet leading to two diferent states

Output of the former depends on the present state and present input

Output of the former depends only on the present state

Output of former depends only on the present input

All of these

Regular expression

DFSM

NDFSM

All of these

Designing computers

Designing compilers

Both (a) and (b)

Developing computers

A* b*

(a | b)*

(ab)+

(a | b*)

FSM can't remember arbitrarily large of information

FSM can't deterministically fix the mid-point

Even if mid-point is known, FSM be can't be found whether, second half of the string matches the first half

All of these

Context - free

Context-sensitive

Recursive

Right-linear

NO

YES

SOMETIMES

Depends on NFA

{a}

{ ∈ , a, b }

{a, b}

{ ab }

{ a, b, ab, aa }

{ a, b, ba, bb }

{ a, b }

{ aa, ab, ba, bb }