Register

construct a DFA to accept all strings which satisfy w(x)mod 5 =2 .

5,356 views

2 Answers

Best answer
4 votes
4 votes

Start state =q0 and Final state =q2

• selected by
User Avatar
0 votes
0 votes
State 0(Input alphabet) 1(Input aphabet)
q0 q0 q1
q1 q2 q3
*q2 q4 q0
q3 q1 q2
q4 q3 q4

Now by above state table draw DFA and make q2 as a final state bcz     w(x)mod5=2

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

Related questions

2 votes
2 votes
2 answers
3
Kapil asked Jul 8, 2016
1,397 views
Regular Expression time complexity
The equality of two regular expression is computed in? Give reasons also.. Constant Time polynomial time logarithmic Polynomial time Exponential time
The equality of two regular expression is computed in? Give reasons also..Constant Timepolynomial timelogarithmic Polynomial timeExponential time
User Avatar
3 votes
3 votes
2 answers
4
im.raj asked Jun 16, 2016
20,840 views
Write regular expression to denote a language L which accepts all the strings which begin or end with either 00 or 11
A. [(00(0+1)* 11] + [11( 0 + 1)* 00]B. [(00+11) (0+1)+] + [( 0 + 1)+ (00+11)].C. [(00+11) (0+1)*] + [( 0 + 1)* (00+11)]D. (00+11) (0+1)* (00+11).
User Avatar
Link Copied!