1
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Given below are two finite state automata ($$ \to $$ indicates the start state and $$F$$ indicates a final state) GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 59 English 1 GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 59 English 2

Which of the following represents the product automation $$ZY$$?

A
GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 59 English Option 1
B
GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 59 English Option 2
C
GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 59 English Option 3
D
GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 59 English Option 4
2
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Which of the following are regular sets? GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 57 English
A
$${\rm I}$$ & $${\rm I}V$$ only
B
$${\rm I}$$ & $${\rm III}$$ only
C
$${\rm I}$$ only
D
$${\rm I}V$$ only
3
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Match the following $$NFAs$$ with the regular expressions they correspond to GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 58 English 1 GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 58 English 2 GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 58 English 3 GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 58 English 4 GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 58 English 5
A
$$P - 2,\,Q - 1,\,R - 3,\,S - 4$$
B
$$P - 1,\,Q - 3,\,R - 2,\,S - 4$$
C
$$P - 1,\,Q - 2,\,R - 3,\,S - 4$$
D
$$P - 3,\,Q - 2,\,R - 1,\,S - 4$$
4
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
A minimum state deterministic finite automation accepting the language $$L = \left\{ {w\left| {w \in } \right.\,\,{{\left\{ {0,1} \right\}}^ * },\,\,} \right.$$ number of $$0'$$s and $$1'$$s in $$w$$ are divisible by $$3$$ and $$5$$, respectively$$\left. \, \right\}$$ has
A
$$15$$ states
B
$$11$$ states
C
$$10$$ states
D
$$9$$ states
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12