Answer Happy

Accurate answers. Every time.
https://answerhappy.com/

Construct a DFA that does not recognises L, where L = {w|w contains a substring of 101}.

https://answerhappy.com/viewtopic.php?t=222998

Page 1 of 1

Construct a DFA that does not recognises L, where L = {w|w contains a substring of 101}.

Posted: Fri May 20, 2022 11:17 am
by answerhappygod
Construct a DFA that does not recognises L, where L = {w|w
contains a substring of 101}.
All times are UTC-05:00
Page 1 of 1

Powered by phpBB® Forum Software © phpBB Limited