GATE CSE 2007 | Finite Automata and Regular Language Question 70 | Theory of Computation

PREVIOUS NEXT

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

Which of the following languages is regular?

$$\left\{ {w{w^R}} \right.\left| {w \in \left\{ {0,\,1} \right\}\left. {^ + } \right\}} \right.$$

$$\left\{ {w{w^R}} \right.x\left| {x,w \in \left\{ {0,\,1} \right\}\left. {^ + } \right\}} \right.$$

$$\left\{ {wx{w^R}} \right.\left| {x,w \in \left\{ {0,\,1} \right\}\left. {^ + } \right\}} \right.$$

$$\left\{ {xw{w^R}} \right.\left| {x,w \in \left\{ {0,\,1} \right\}\left. {^ + } \right\}} \right.$$

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

Consider the following finite state automation GATE CSE 2007 Theory of Computation - Finite Automata and Regular Language Question 70 English

The minimum state automation equivalent to the above $$FSA$$ has the following number of states

$$1$$

$$2$$

$$3$$

$$4$$

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

Consider the following finite state automation GATE CSE 2007 Theory of Computation - Finite Automata and Regular Language Question 71 English

The language accepted by this automation is given by the regular expression

$${b^ * }a{b^ * }a{b^ * }a{b^ * }$$

$${\left( {a + b} \right)^ * }$$

$${b^ * }a{\left( {a + b} \right)^ * }$$

$${b^ * }a{b^ * }a{b^ * }$$

GATE CSE 2007

MCQ (Single Correct Answer)

-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

$$15$$ states

$$11$$ states

$$10$$ states

$$9$$ states

PREVIOUS NEXT