Register

Self doubts DFA

274 views
0 votes
0 votes
The minimum no. of states required to construct DFA which can accept length of the string is devisable by 4 where input string is 0,1

Please also construct dfa
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

0 votes
0 votes
2 answers
1
altamash asked Dec 25, 2018
268 views
self doubts
{w1 x w2|w1,x,w2∈(a+b)*,w1=w2} it is regular ?????
{w1 x w2|w1,x,w2∈(a+b)*,w1=w2}it is regular ?????
User Avatar
0 votes
0 votes
0 answers
2
altamash asked Dec 25, 2018
208 views
self doubts
explain why it is CFL?
explain why it is CFL?
User Avatar
0 votes
0 votes
1 answer
3
altamash asked Sep 21, 2018
303 views
self doubts
what is minimum number of states of NFA which accepts language {abab^n|n>=0} U{aba^n|n>=0}
what is minimum number of states of NFA which accepts language{abab^n|n>=0} U{aba^n|n>=0}
User Avatar
–1 votes
–1 votes
0 answers
4
altamash asked Sep 21, 2018
204 views
self doubts
what is minimum number of state in the NFA accepting the language;{ab 4ubc}?
what is minimum number of state in the NFA accepting the language;{ab 4ubc}?
User Avatar
Link Copied!