edited by
6,783 views
0 votes
0 votes

The finite state machine given in figure below recognizes:

  1. anu string of odd number of a's
  2. anu string of odd number of b's
  3. any string of even number of a's and odd number of b's
  4. any string of odd number of a's and odd number of b's
edited by

2 Answers

1 votes
1 votes

Option D

Related questions

1 votes
1 votes
2 answers
1
Pooja Khatri asked Jul 13, 2018
15,273 views
Two finite state machines are said to be equivalent if they:Have the same number of edgesHave the same number of statesRecognize the same set of tokensHave the same numbe...
0 votes
0 votes
6 answers
2
0 votes
0 votes
3 answers
3
Pooja Khatri asked Jul 13, 2018
3,222 views
Pushdown automata can recognize language generated by _______Only context free grammarOnly regular grammarContext free grammar or regular grammarOnly context sensitive gr...
0 votes
0 votes
1 answer
4
Pooja Khatri asked Jul 13, 2018
1,238 views
To obtain a string of n Terminals from a given Chomsky normal from grammar, the number of productions to be used is$2n-1$$2n$$n+1$$n^2$