GATE CS 2007 — Question 31
A minimum state deterministic finite automaton accepting the language \(L = \{w \mid w \in \{0,1\}^*\), number of 0s and 1s in \(w\) are divisible by 3 and 5, respectively\(\}\) has
Subject-wise GATE questions
Theory of Computation
12 questions and papers
GATE CS 2005 — Question 56
Consider the languages \(L_1 = \{a^n b^n c^m \mid n, m > 0\}\) and \(L_2 = \{a^n b^m c^m \mid n, m > 0\}\). Which one of the following statements is FALSE?
Answers and explanations unlock on sign-in
Every question here is free to read. A free account adds the verified key, the worked solution and your progress.