Register

UGC NET CSE | June 2007 | Part 2 | Question: 1

• edited by
510 views
1 votes
1 votes

The following determiniotic finite automata recognizes:

  1. Set of all strings containing $’ab’$
  2. Set of all strings containing $’aab’$
  3. Set of all strings ending in $’abab’$
  4. None of the above
• edited by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

785
views
0 answers
0 votes
go_editor asked Mar 28, 2020
785 views
UGC NET CSE | June 2007 | Part 2 | Question: 2
Depth ion travels of the following directed graph is:$\text{A B C D E F}$\text{A B D E F C}$\text{A C E B D F}$None of the above
User Avatar
1.3k
views
0 answers
0 votes
go_editor asked Mar 28, 2020
1,265 views
UGC NET CSE | June 2007 | Part 2 | Question: 3
The maximum number of nodes in a binary tree of depth $10$:$1024$ $2^{10}-1$ $1000$None of the above
User Avatar
1.3k
views
1 answers
1 votes
go_editor asked Mar 28, 2020
1,337 views
UGC NET CSE | June 2007 | Part 2 | Question: 4
The regular expression given below describes:$r=(1+01)$*$(0+\lambda)$Set of all string not containing $’11’$Set of all string not containing $’00’$Set of all string containing $’01’$Set of all string ending in $’0’$
User Avatar
315
views
1 answers
0 votes
go_editor asked Mar 28, 2020
315 views
UGC NET CSE | June 2007 | Part 2 | Question: 5
Which of the following language is regular:$L=${${a^{n}b^{n}|n\geq 1}$}$L=${${a^{n}b^{m}c^{n}d^{m}|n,m\geq 1}$}$L=${${a^{n}b^{m}|n,m\geq 1}$}$L=${${a^{n}b^{m}c^{n}|n,m\geq 1}$}
User Avatar
Link Copied!