Back to the 2024 paper
Similar questions
Formal Language & Automata TheoryDesign deterministic finite automata for the set of strings over the alphabet \{a, b\} containing at least three occurrences of three consecutive b's, overlapping permitted (e.g., the string bbbbb should be accepted).20197mFORMAL 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 THEORYConstruct an NFA accepting strings over \{0,1,2\} beginning with 0, followed by an odd number of 1s, ending with any number of 2s.20217mFORMAL LANGUAGE & AUTOMATA THEORYDesign a DFA for the regular expression: 1^*(10)^*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
Budget AppAndroid App
Pocketly on Android
Log daily food, travel, and hostel expenses instantly. Set monthly spending limits and see where your money goes without complex spreadsheets.