Register

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

553 views
0 votes
0 votes
User Avatar

1 Answer

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

Related questions

435
views
0 answers
0 votes
Anuanu asked Jun 24, 2016
435 views
how many states are there in a minimum state deterministic finite automaton accepting language l ={ w| w e(0,1)*
User Avatar
282
views
0 answers
0 votes
Anuanu asked Jun 24, 2016
282 views
how many states are there in a minimum state deterministic finite automaton accepting language
User Avatar
3.4k
views
2 answers
2 votes
Anurag_s asked Aug 15, 2015
3,369 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
1.3k
views
3 answers
2 votes
Don't you worry asked Jun 1, 2016
1,267 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 ?
User Avatar
Link Copied!