retagged by
404 views
0 votes
0 votes

Give the state diagram of DFAs with the specified number of states recognizing each of the following languages. In all parts, the alphabet is {0, 1}.

 

  1. {w | accept all string except 11 or 110}

 

  1. {w | w begins with a 11 and ends with a 0}

 

  1. {w | All string accepted except empty set}

 

  1. {w : w contains sub string 1111 }

 

  1. {w : w start with 00 and has odd length }

 

  1. {w| w does not contain the substring 1101}

 

  1. { w | w contains at least three 0s }

 

  1. { w | w contains the substring 0101, i.e., w = x0101y for some x and y }
retagged by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
baofbuiafbi asked Nov 14, 2023
151 views
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.
1 votes
1 votes
1 answer
2
Overflow04 asked Oct 30, 2022
535 views
Number of 3 state DFA with designated initial state can be constructed over the alphabet $\sum$ = {0,1,2} with exactly 2 final states is$3^{8}$ B)$3^{9}$ C) $3^{10}$ D...
3 votes
3 votes
3 answers
3
Hirak asked May 22, 2019
1,354 views
How many $2$ state DFA’s with the designated initial state can be constructed over the alphabet over the alphabet $\sum = \{a, b\}$ that accept universal language?$4$$1...
0 votes
0 votes
3 answers
4
moe12leb asked Nov 27, 2022
663 views
Write a regular expression for all strings of 0’s and 1’s in which there is an even number of 0’s between any two 1’s.