Madeeasy Workbook

Question

Is it true statement?

An FA accepts empty language iff there is no simple path from initial vertex to any final vertex.

 

Doubt:- L= phi, we can draw a one state i.e. starting state and give all input

If we make two state S0 and S1 and give input (epsilon) on starting state(S0) which is going to S1.

There is a path exist then which is having epsilon.

Comments

Yes as parallel paths and self loops are not allowed in simple graph the answer should be false