Back to the 2019 paper
Similar questions
FORMAL 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 TheoryLet \Sigma = \{0, 1\}. Let L be the language that consists of strings having either 01 repeated one or more times or 010 repeated one or more times. Is L regular? Explain.20197mFormal Language & Automata TheoryLet G be a context-free grammar in Chomsky normal form that contains b variable. Show that if G generates some string using a derivation with at least 2^b steps, then L(G) is infinite.20217mFormal Language & Automata TheoryA minimum state deterministic finite automaton accepting the language L = \{w \mid w \in \{0, 1\}^*, \text{ number of 0's and 1's in } w \text{ are divisible by 3 and 5 respectively}\} has (i) 15 states (ii) 11 states (iii) 10 states (iv) 9 states20192m
PreviousLet \Sigma = \{0, 1\}. Let L be the language that consists of strings having either 01 repeated one or more times or 010 repeated one or more times. Is L regular? Explain.NextDesign a push-down automata for accepting the string for the language L = \{WW^R \mid W \in \{a, b\}^*\} by the empty stack as well as final state.
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.