Discrete Structure - Old Questions
Question Answer Details
13. Define deterministic finite state automata. Construct a DFA whose language is the set of strings that ends with 111 and contains odd number of 1’s.
Answer
AI Generated Answer
AI is thinking...