5) Give state diagrams of DFAs recognizing the following languages. In all parts the alphabet is {0, 1} a. {ww begins with a 1 and ends with a 0} b. {ww contains at least three 1s} c. {ww contains the substring 0101} d. {ww has length at least 3 and its third symbol is a 0} e. {ww starts with 0 and has odd length, or starts with 1 and has even length} f. {w w doesn't contain the substring 110} g. {w the length of w is at most 5} h. {ww is any string except 11 and 111} i. {w every odd position of w is a 1}

5) Give state diagrams of DFAs recognizing the following languages. In all parts the alphabet is {0, 1} a. {ww begins with a 1 and ends with a 0} b. {ww contains at least three 1s} c. {ww contains the substring 0101} d. {ww has length at least 3 and its third symbol is a 0} e. {ww starts with 0 and has odd length, or starts with 1 and has even length} f. {w w doesn't contain the substring 110} g. {w the length of w is at most 5} h. {ww is any string except 11 and 111} i. {w every odd position of w is a 1}

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

5. Design a CFG that recognizes the languages: a. Li = {w| w contains even number of 0's} where the alphabet is E={0,1}? b. L, = {w length is even} where the alphabet is E={0,1}? Answer: a) b)
5. Find a DFA for each of the following languages over the alphabet (a, b). a. (ab, abab, ababab, ...} b. Ø. C. {E}. d. [ɛ, ab, abab, ababab, ...}
5. Write a regular expression for each of the following languages. { we {a, b}* : w begins and ends with the same symbol} а. b. {we {a, b}* : w contains exactly one pair of consecutive a's} { we { a, b}* : na(w) is odd or nh (w) is even } с.
Give the state diagrams of DFAs recognizing the following languagesover Σ = {0, 1}:a. {w : w does not contain substring 10}b. {w : every odd position of w is a 1}c. {w : w contains at least one 0 and at least one 1}
Construct regulargrammars for the following language { w E {a,b}* / w starts and ends with aaand contains bbbas substring}
2. Write regular expression for each of the following languages over { = {0,1}. a. Each 0 in w (E Σ*) must be followed by at least two 1's. b. Each string w (E Σ*) contains at most one 'O'.
For each of the following languages L, give a regular expression that represents L and draw or describe a DFA that recognizes L. You do not need to justify your answers. (a) All strings in {0,1}* that do not contain either 100 or 011 as a substring (b) All strings in {0, 1,2}* that do not contain either 01 or 12 or 20 as a substring
Q.No.5. Make a CFG for the language having EVEN number of a's and EVEN number of b’s and starts with “ab" and ends on “ba" defined over E={a,b}.
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 produce a final state diagram for the original language. Assume the alphabet Σ = {a,b}.a. {w|w contains neither the substrings ab nor ba} b. {w|w is any string not in a*b*}c. {w|w is any string not in (ab+)*}
1. For each of the following regular expressions find a language (i.e., a set of strings) over A = {a,b,c} that can be represented/described by that expression. a. a*bc + bc* b. b*aaac* а. b.
Construct the DFA that accepts the language defined by the regular expression over the alphabet{a,b}: (a+b)(a+b)b(a+b)*
Mistheset{a,b,...,z}andLtheset{0,1,...,9}. Describe the following languages:  ML  (MUL)  M4  L*  M(M U L)*  M+  LML