in GATE
5,391 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\}$
in GATE
5.4k views

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

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

64.3k questions

77.9k answers

244k comments

80.0k users