Register

DFA construction

• edited by
65 views
0 votes
0 votes
construct a minimal DFA for the regular language L= {W | w contain 'a' in every odd position, w∈{a,b}* }
• edited by
User Avatar

Please log in or register to answer this question.

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

Related questions

156
views
1 answers
0 votes
Unnati Singh asked May 7
156 views
DFA construction
Design a DFA to recognize all strings over {a,b} such that L={awa : w ϵ {a,b}* }.
User Avatar
249
views
2 answers
0 votes
Unnati Singh asked May 7
249 views
DFA construction
Construct a DFA with minimum number of states, accepting all strings over {a, b} such that the number of a’s is divisible by three and the number of b’s is divisible by two.
User Avatar
195
views
1 answers
0 votes
rdrd44 asked May 3
195 views
DFA construction
Design a DFA (Deterministic Finite Automaton) that recognizes the language L defined follows: L= {w -> {a, b}* | every a in w is immediately followed by bb}
User Avatar
217
views
0 answers
0 votes
rania asked Feb 14
217 views
DFA construction
Each of the following languages is the complement of a simpler language.In each part, construct a DFA for the simpler language, then use it to give the state diagram of a DFA for the ... not in $a^{*}\cup b^{*}$ } ( ∪ is the union )
User Avatar
Link Copied!