Back to the 2019 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYWhich of the following CFLs is deterministic? (i) {a^n b^n} (ii) Arithmetic expressions (iii) Palindromes (iv) {ww^R}20252mFormal Language & Automata TheoryIf L1 and L2 are context-free languages, L1-L2 is \_\_\_\_ context-free. (i) always (ii) sometimes (iii) never (iv) None of the above20212mFormal Language & Automata TheoryA language accepted by deterministic pushdown automata is closed under which of the following? (i) Complement (ii) Union (iii) Both (i) and (ii) (iv) None of the above20202mFORMAL LANGUAGE & AUTOMATA THEORYA language accepted by deterministic pushdown automata is closed under which of the following? (i) Complement (ii) Union (iii) Both (i) and (ii) (iv) None of the above20232m
PreviousA 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 statesNextConsider the following statements about the context-free grammar: (1) G = \{S \to SS, S \to ab, S \to ba, S \to \epsilon\} (2) G is ambiguous (3) G produces all strings with equal number of a's and b's G can be accepted by a deterministic PDA. Which combination below expresses all the true statements about G? (i) 1 only (ii) 1 and 3 (iii) 2 and 3 (iv) 1, 2 and 3