1 votes 1 votes Construct a Deterministic Finite Automaton $\text{(DFA)}$ with $5$ states that accepts all strings with $0101$ as a substring. Theory of Computation drdocse-2022-paper2 theory-of-computation finite-automata 5-marks descriptive + – admin asked Dec 15, 2022 • recategorized Jan 26, 2023 by Lakshman Bhaiya admin 500 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Accepts all the strings with substring $0101$, the regular expression will be: $R=(0+1)^*0101(0+1)^*$ The DFA is as follows: Hira Thakur answered Dec 16, 2022 Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.