Register

ISRO2014-33

5,443 views
7 votes
7 votes

The following Finite Automaton recognizes which of the given languages?

  1. $\{ 1, 0 \}^* \{ 0 1 \}$
  2. $\{ 1,0\}^*\{ 1\}$
  3. $\{ 1 \} \{1, 0\}^*\{ 1 \}$
  4. $1^*0^*\{0,1\}$
User Avatar

5 Answers

Best answer
8 votes
8 votes
Option A] is the answer.

How ?  Try each option.Validate strings in given FA. start from small strings.
• edited by
User Avatar
2 votes
2 votes
yes A is the ans

eliminate all other ..how check

B.{ 1 } is not accepted by the fa.

c.{1}{1} is not accepted by fa

d.{0} is not accepted

with opt A .all strings generated can be accepted
User Avatar
1 votes
1 votes
Given DFA accepts all strings ending with "01", so the language should be (0+1)*01. Option (A) is correct,
• edited by
User Avatar
0 votes
0 votes
D. 1*0*(0+1), only 0 only 1 not accepted hence it's false

C. 1(1+0)*1, 11 is the invalid string for here also false

B.(1+0)*1, same as option D 1 is rejected by FA

A. (1+0)*(01) genrate language like {01,101,1101,1001,0101,0001,11101,11001,10001,01101.....} all are accepted by above FA so it's correct.
• edited by
User Avatar
Page:
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

8 votes
8 votes
3 answers
1
go_editor asked Jul 1, 2016
4,801 views
ISRO2014-79
Consider the following Deterministic Finite Automaton $M$. Let $S$ denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. The number of strings in $S$ that are accepted by $M$ is 0 1 2 3
Consider the following Deterministic Finite Automaton $M$.Let $S$ denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. The number of str...
User Avatar
19 votes
19 votes
5 answers
2
Isha Karn asked Oct 29, 2014
10,560 views
ISRO2014-2
The number of states required by a Finite State Machine,to simulate the behavior of a computer with a memory capable of storing 'm' words, each of length 'n' bits is? $m \times 2^n$ $2^{m+n}$ $2^{mn}$ $m+n$
The number of states required by a Finite State Machine,to simulate the behavior of a computer with a memory capable of storing 'm' words, each of length 'n' bits is?$m \...
User Avatar
3 votes
3 votes
1 answer
3
go_editor asked Jul 1, 2016
3,681 views
ISRO2014-80
A computing architecture, which allows the user to use computers from multiple administrative domains to reach a common goal is called as Grid Computing Neutral Networks Parallel Processing Cluster Computing
A computing architecture, which allows the user to use computers from multiple administrative domains to reach a common goal is called asGrid ComputingNeutral NetworksPar...
User Avatar
8 votes
8 votes
3 answers
4
go_editor asked Jul 1, 2016
4,682 views
ISRO2014-78
Which of the following is not an optimization criterion in the design of a CPU scheduling algorithm? Minimum CPU utilization Maximum throughput Minimum turnaround time Minimum waiting time
Which of the following is not an optimization criterion in the design of a CPU scheduling algorithm?Minimum CPU utilizationMaximum throughputMinimum turnaround timeMinimu...
User Avatar
Link Copied!