Computer Sciences > GATE 2023 > Theory of Computation
Consider the language L over the alphabet {0, 1}, given below: L = {w ∈ {0, 1}* | w does not contain three or more consecutive 1's}. The minimum number of states in a Deterministic Finite-State Automaton (DFA) for L is _______.
Correct : 4
Similar Questions
Consider the Deterministic Finite-state Automaton (DFA) A shown below. The DFA runs on the alphabet {0, 1}, and has the set of states {s,p,q,r}, with s being th...
Consider the following definition of a lexical token id for an identifier in a programming language, using extended regular expressions:
Which one of the fo...
Consider the context-free grammar G below: S -> aSb | X X -> aX | Xb | a | b where S and X are non-terminals, and a and b are terminal symbols. The starting non...
Total Unique Visitors
Loading......