Register

how many states are there in a minimum state deterministic finite automaton accepting language l ={ w| w e(0,1)*
closed

• closed by
425 views
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Anuanu asked Jun 24, 2016
528 views
how many states are there in a minimum state deterministic finite automaton accepting language l ={ w| w e(0,)*
User Avatar
0 votes
0 votes
0 answers
2
Anuanu asked Jun 24, 2016
273 views
how many states are there in a minimum state deterministic finite automaton accepting language
User Avatar
2 votes
2 votes
2 answers
3
Anurag_s asked Aug 15, 2015
3,308 views
Let Σ= {a}, assume language, L= { a^(2012.K) / K> 0}, what is minimum number of states needed in a DFA to recognize L
Let Σ= {a}, assume language, L= { a^(2012.K) / K 0}, what is minimum number of states needed in a DFA to recognize L
User Avatar
2 votes
2 votes
3 answers
4
Don't you worry asked Jun 1, 2016
1,226 views
What is the accepting state for this finite automaton ?
What is the complement of given DFA accepting :? What is the Regular expression for this FA ?
What is the complement of given DFA accepting :?What is the Regular expression for this FA ?
User Avatar
Link Copied!