Question

For the alphabet = {0,1} write a DFA that accepts all strings that starts with 10 and ends with 01.​

Answer 1

Strings such as {1101,101,10101} are being accepted while {1001,11001} are not. Thus, this conclusion leads to 5