The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
20 views
asked in Theory of Computation by (7 points) | 20 views

1 Answer

0 votes
Can't say anything actually. Language accepted could be anything..finite or infinite or  language Could be or Could not be $\Sigma^*$...

But if All the states or all the reachable states of a DFA are final states then it will definitely accept $\Sigma^*$.
answered by Boss (13.2k points)


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

36,157 questions
43,608 answers
123,961 comments
42,860 users