Question

design DFA and NDFA accepting all string over {0,1} which end with 010​

Answer 1

Answer:

Heya!!!

Step-by-step explanation:

Given a binary string str, the task is to build a DFA that accepts the string if the string either starts with “01” or ends with “01”.

Input: str = “010000”

Output: Accepted

Explanation:

The given string starts with “01”.

Input: str = “1100111”

Output: Not Accepted

Explanation:

The given string neither starts with nor ends with “01”.

#Hope it helps :D

#Stay Safe :)