5,388 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\}$

5 Answers

0 votes
0 votes
Smallest string accept by the NFA is 01. In option b,c and d . Does not gives smallest string 01 . So it is clearlly false.

But in option a smallest string is 01 . So it is true
Answer:

Related questions

8 votes
8 votes
3 answers
1
go_editor asked Jul 1, 2016
4,762 views
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...
19 votes
19 votes
5 answers
2
Isha Karn asked Oct 29, 2014
10,470 views
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 \...
3 votes
3 votes
1 answer
3
go_editor asked Jul 1, 2016
3,657 views
A computing architecture, which allows the user to use computers from multiple administrative domains to reach a common goal is called asGrid ComputingNeutral NetworksPar...
8 votes
8 votes
3 answers
4
go_editor asked Jul 1, 2016
4,649 views
Which of the following is not an optimization criterion in the design of a CPU scheduling algorithm?Minimum CPU utilizationMaximum throughputMinimum turnaround timeMinimu...