Register

UPPCL NFA Problem

797 views

1 Answer

Best answer
1 1 vote
It's NFA starting and ending with 0 and NOT including 0 (0 also starts and ends with 0)

so the regular expression is : 0(0+1)*0

.: 1 and 3 are correct options.
• selected by
Voting & Accepting an answer helps improve the community
← Previous · Series expansionNext → · TestBook Test Series...
← Previous in category · Minimum number of st...Next in category → · TOC Grand Test 1 Que...
Position:
Show:

Related questions

0 0 votes
1 1 answer
264
264 views
mohamed_bahgat asked Jun 3, 2025
264 views
Given Language: L = { a b ∪ a b a } ∗ L={ab∪aba} ∗ Problem Statement: If X X is the minimum number of states required for a DFA to accept L L, and Y Y is the number of states required for an NFA to accept L L, then what is ∣ X − Y ∣ ∣X−Y∣? Multiple Choice Answers: a) 1 b) 2 c) 3 d) 4
0 0 votes
0 0 answers
730
730 views
Devwritt asked Nov 11, 2016
730 views
UPPCL 2013 Hashing problem
0 0 votes
0 0 answers
598
598 views
Devwritt asked Nov 10, 2016
598 views
UPPCL Problem Algorithm problem
1 1 vote
1 1 answer
69
69 views
GO Classes asked 3 days ago
69 views
GO Classes DPP | GATE CS | Theory of Computation | De Morgan & NFA
Consider,Statement $1:$ If a language family is closed under union and complement, then it must also be closed under intersection. Statement $2:$ An NFA can be constructe...