Question

I need help creating an NFA for the language Σ={0,1}, L={w such that w does not contain 11 or w ends with 00}. for example 10010100100 is in the language, where as 101010011 is not.

Answer 1

Given L is union of two languages

1st language is 11 not as substring

2nd language is ends with 00

so the language L has both not contains 11 or ends with 00

so the NFA for the language is

if string contain 11 then it must be ends with 00

if string does not ends with 00 then the string not contain sub string11

if both also comes under this language

so the NFA for this is

Lb 791 ob 94

String acceptance is

Table Text Size Result Input 10010100100 101010011 Accept Reject Load Inputs Run Inputs Clear Enter Lambda View Trace

Any queries comment please

Thank you:)