Awesome q2a theme

ACE Test Series

0 votes
23 views
What is the minimum no of states in DFA which accepts the language generated by reg exp (0*1)*1(0+1)* ?. Is this binary strings containing 1? Pls Answer.
in Theory of Computation by (5 points) | 23 views
0

 Is this binary strings containing 1?

Yes, but only if the alphabet is {0, 1} though.

Answer should be 2

by (3.2k points)
0
Thank you for answering. I too thought 2 would be the answer. But the answer given was minimum 4 states.
by (5 points)
0
by (1.5k points)

Please log in or register to answer this question.

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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
9,092 questions
3,152 answers
14,579 comments
95,935 users