Register

Minimal Dfa

827 views

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · Operating systemNext → · LR Parsers
← Previous in category · FA to Regular Expres...Next in category → · Theory of computatio...
Position:
Show:

Related questions

2 2 votes
2 2 answers
263
263 views
GO Classes asked Jul 10
263 views
GO Classes DPP | GATE CS | Theory of Computation | Minimal DFA
Let $\Sigma = \{a\}$. Consider the language $L = \{a^{nk} \mid k 0,\ n$ is a positive integer constant$\}$. What is the minimum number of states in a DFA that recognises...
2 2 votes
2 2 answers
295
295 views
codertoday asked Dec 10, 2025
295 views
Minimal DFA
 could someone please draw the DFA? Is the answer 16 or 18?
0 0 votes
1 1 answer
336
336 views
Abhishek_Panthi asked Aug 14, 2025
336 views
For the regular expression R = (a*(bba*)*bbab*)* the minimal DFA has a certain number of final and non-final states (excluding any dead states, if any). Find the difference (Final − Non-final). A) -1 B) 0 C) 1 D) 2
0 0 votes
2 2 answers
559
559 views
sateeshhhhhh asked Sep 1, 2023
559 views
how many final states in minimal dfa that is not divisible by 3