Question

Q2 [10 pts] Give DFA's accepting the following languages over the alphabet {0,1}: a) The set...

Q2 [10 pts] Give DFA's accepting the following languages
   over the alphabet {0,1}:

   a) The set of all strings whose 3rd symbol from the right end
      is a 0.

   b) The set of strings such that the number of 0's is divisible
      by 3 and the number of 1's divisible by 2.
Engineering   Computer-Science   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

Thank you.please give thumbs up.

If you have any queries please comment me.

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Which one of the following languages over the alphabet {0,1} is described by the regular expression...
Which one of the following languages over the alphabet {0,1} is described by the regular expression (0+1)* 0 (0+1)* 0 (0+1)* ? a.The set of all strings that begin and end with either 0 or 1 b.The set of all strings containing at most two zeros c.The set of all strings containing at least two zeros. d.The set of all strings containing the substring 00
Consider the language L of all strings over {0,1} whose 2rd symbol from right end is...
Consider the language L of all strings over {0,1} whose 2rd symbol from right end is 0 and 3rd symbol is 1 from right end.   a) Design a NFA to accept the language L. b) Write regular expressions for the languages L.
Give a regular expression for the set of all strings on the alphabet {0,1} with no...
Give a regular expression for the set of all strings on the alphabet {0,1} with no runs of length greater than 3(for example, no substrings 0^i or 1^i with i > 3)
Let F be the set of all finite languages over alphabet {0, 1}. Show that F...
Let F be the set of all finite languages over alphabet {0, 1}. Show that F is countable
Automata Theory and Formal Languages Instructions: Draw the DFA (Deterministic Finite Automaton) of the following: DFA...
Automata Theory and Formal Languages Instructions: Draw the DFA (Deterministic Finite Automaton) of the following: DFA which accepts strings of odd length Design a DFA over w ∈ {a,b}*such that number of a = 2 and there is no restriction over length of b DFA for Number of a(w) mod 2 = 0 and Number of b(w) mod 2 = 0 DFA for Number of a(w) mod 2 = 0 orNumber of b(w) mod 2 = 0 DFA for Number...
The alphabet is Ʃ = {a,b}. Give regular expressions that generate the following languages below. Use...
The alphabet is Ʃ = {a,b}. Give regular expressions that generate the following languages below. Use these symbols: Ʃ, a, b, ε, Ø, *, (, ), U. 1) ? = {? | ? contains an odd number of a's and ends with b} 2) ? = {a? b? | ? < 5,? < ?} 3) ? = {? | ? contains the substring ab and contains the substring ba} 4) ? = {? | ? has an odd number of...
1.2 Which of the following statements is wrong?        a). A set is a subset of itself...
1.2 Which of the following statements is wrong?        a). A set is a subset of itself        b). Emptyset is a subset of any set        c). A set is a subset of its powerset        d). The cardinality of emptyset is 0 1.3. Which of the following statements is correct?        a). A string is a set of symbols from an alphabet        b). The length of the concatenation of two strings can           be the same as one of them        c). The length of...
Design deterministic finite automata for each of the following sets: 1) The set of strings x...
Design deterministic finite automata for each of the following sets: 1) The set of strings x ε {0, 1}* such that #0(x) is even and #1(x) is a multiple of three. 2) The set of all strings in {1, 2, 3}* containing 231 as substring. 3) The set of strings in (a)* whose length is divisible by either 2 or 7.
Give a regular expression for each of the following sets: a) set of all string of...
Give a regular expression for each of the following sets: a) set of all string of 0s and 1s beginning with 0 and end with 1. b) set of all string of 0s and 1s having an odd number of 0s. d) set of all string of 0s and 1s containing at least one 0. e) set of all string of a's and b's where each a is followed by two b's. f) set of all string of 0s and...
Automata Theory and Formal Languages Problems 1: Consider the following two grammars. Grammar G1- S →...
Automata Theory and Formal Languages Problems 1: Consider the following two grammars. Grammar G1- S → aSb / ∈ Grammar G2- S → aAb / ∈, A → aAb / ∈ a. is G1=G2 b. What is the grammar generated by the expression Problem 2: Let us consider the grammar. G2 = ({S, A}, {a, b}, S, {S → aAb, aA → aaAb, A → ε } ) Derive aaabbb Problem 3: Suppose we have the following grammar. G: N...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT