diagrams of a DFA that accepts the language. i. {w |w contains the substring 0101} ii. {w | w contains an even number of Os, or contains exactly two 1s} (b) For each of the following languages defined over the alphabet E = {0,1}, provide state diagrams of an NFA that accepts the language with the specified number of states. i. The language of 2-(a)-i with five states. ii. The language of 2-(a)-ii with six states. (c) Provide a formal description of a DFA that accepts the following language.

diagrams of a DFA that accepts the language. i. {w |w contains the substring 0101} ii. {w | w contains an even number of Os, or contains exactly two 1s} (b) For each of the following languages defined over the alphabet E = {0,1}, provide state diagrams of an NFA that accepts the language with the specified number of states. i. The language of 2-(a)-i with five states. ii. The language of 2-(a)-ii with six states. (c) Provide a formal description of a DFA that accepts the following language.

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

Create a PDA that accepts the language L = {w ∈ {a.b}* : na(v) ≥ nb(v), where v is any prefix of w}
1) Given the following English descriptions of a language, write a regular expression that defines the language, and draw the state diagram of a DFA that accepts the language. For all languages, let Σ = {a, b}.a) The language consisting of all words having a number of a's that is a multiple of 3.b) The language consisting of all words that contain "babb".c) The language consisting of all words that end in "ba".d) The language consisting of all words that do not end in "ba".
b) What is the language that the following CFG generate? (describe by RE) S>aXa S>bXb X>aX XbX
Given: Language L2 = {w ϵ {a,b}* | w contains substring aab} Construct the DFA representing the given language L2. Assume the layout of the DFA is as follows: ->A->B->C->D*. That is, the number of states are four (4) and A is the starting state and D is the accepting state. What is the next state for the input pair (D,b) in the constructed DFA? A B C D
Please work on these problems individually, and do not discuss them, verbally or otherwise, with anyone else. You may email me with any questions you have. You may also consult textbooks, but you must acknowledge and reference any material you use to solve these problems. You are not allowed to search for solutions on the Web and you may not post these problems on any Web forum asking for answers. Problem 1. Consider the language D = {:A is a DFA such that w e L(A) =ww e L(A)}. For example, if L(A,) = 0* then A, E D, but if L(A2) is the set of all binary strings without two consecutive 1's then A2 ¢ D because 101 e L(A2) and 101101 ¢ L(A2). Describe a high-level algorithm to decide D and give an intuitive argument with enough detail showing that your algorithm is correct. Hint: Construct a DFA that runs its input in parallel on multiple copies of A, but starting in different states.
Given: Language L2 = {w e {a,b}* | w contains substring aab} Construct the DFA representing the given language L2. Assume the layout of the DFA is as follows: ->A->B->C->D*. That is, the number of states are four (4) and A is the starting state and D is the accepting state. What is the next state for input pair (D,b) in the constructed DFA? A В C D
Write a CFG to represent the expressions of a programming language with following characteristics: • The language supports addition (+) and multiplication (*) operations only. The language allows only two alphabets a and b, and two digits 0 and 1.. The identifiers must begin with a or b, followed by any string in {a, b, 0, 1)*.
Given: Language L2 = {w ϵ {a,b}* | w contains substring aab} Construct the DFA representing the given language L2. Assume the layout of the DFA is as follows: ->A->B->C->D*. That is, the number of states are four (4) and A is the starting state and D is the accepting state. What is the next state for input pair (B,b) in the constructed DFA? Choices A B C D
2. Define CFGs for the following languages: a. Language L(r) defined over the alphabet {0,1} where r = 01(0 + 01* (0 + 00)).b. The language defined over the alphabet {a,b} where each string is of the form XY;The regular expression defining the X part is (a + b) (a + b)*; The Y part can beexpressed as 1 n where n = |X|.
1.F 1. Prove that the following language L is not contextfree: L = { a'b'a| j>i>1 }.
Regular Expression and Languages:(a) Given the language A = {”a”, ”bb”} and B = {”d”}, what is the language AB?(b) Given the language A = {”a”, ”bb”} and B = {”d”}, what is the language A|B?(c) Given the language C = {”aa”, ”b”}, what is the language C^0? C^0means that C appears zero times.
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)