Back to the 2024 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYConstruct an NFA that accepts all strings over the alphabet {0, 1, 2} that begin with one or more 0s, followed by an odd number of 1s, and end with any number of 2s.20257mFORMAL LANGUAGE & AUTOMATA THEORYLet L \subseteq \{0,1,2\}^* be strings without consecutive identical symbols (no 00, no 11, no 22). Design a DFA for L.20227mFORMAL LANGUAGE & AUTOMATA THEORYDesign a Turing machine that recognizes strings containing equal number of 0’s and 1’s.20237mFormal Language & Automata TheoryConstruct an NFA that will accept string of 0's, 1's and 2's beginning with a 0's followed by odd number of 1's and ending with any number of 2's.20217m
PreviousDifferentiate between Deterministic Finite Automata (DFA) and Non-Deterministic Finite Automata (NFA). Also, explain the procedure to convert an NFA to DFA with a suitable example.NextGiven a context-free grammar (CFG), compute FIRST and FOLLOW sets for all non-terminals, and construct the LL(1) parsing table. Also, determine whether the grammar is LL(1) or not. Grammar: S \rightarrow A B A \rightarrow a A | \epsilon B \rightarrow b B | \epsilon