4. Consider the following languages. ANFAFIN = {{N) | N is an NFA and L(N) is finite} EREX = {(R) | R is a regular expression and L(R) = 0} • EQREX = {(R1, R2) | R, and R2 are regular expressions and L(R) = L(R2)} EQ NPAFINSET = {(N, U) | N is an NFA, U is a finite set of words, and L(N) = U} ALLREX = {(R) | R is a regular expression and L(R) = {0,1}*} (a) Answer the following questions based on the NFA N as shown below. Simply say yes or no. (1) Is (N) € ANFAFIN? (ii) Is ((0]1)") E EREX? (iii) Is (00", 0*0) e EQREX?

4. Consider the following languages. ANFAFIN = {{N) | N is an NFA and L(N) is finite} EREX = {(R) | R is a regular expression and L(R) = 0} • EQREX = {(R1, R2) | R, and R2 are regular expressions and L(R) = L(R2)} EQ NPAFINSET = {(N, U) | N is an NFA, U is a finite set of words, and L(N) = U} ALLREX = {(R) | R is a regular expression and L(R) = {0,1}} (a) Answer the following questions based on the NFA N as shown below. Simply say yes or no. (1) Is (N) € ANFAFIN? (ii) Is ((0]1)") E EREX? (iii) Is (00", 00) e EQREX?

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

1) Given the alphabet as {0, 1}, write a DFA for the following three regular languages.(Give the complete description of the DFA with transition function as a table and also as a transition graph) (i) L = {w | w is a string of even length} (ii) L = {w | |w| mod 3 = 0} (iii) L = {w | w contains the string 001 as a substring} 2)Describe the extended transition function on a string recursively using transitions one symbol at a time for the three automata of the above problem. (i) A string (of length >=4) that belongs to the language (II) A string (of length >=4) that does not belong to the language
Suppose L is any Regular language defined over the alphabet Σ = {0, 1} where every string contains atmost one 0's and atleast two 1's. If M is the DFA that Accepts L, then least number of states required to be in minimal DFA will be?
Computer Science Suppose L ⊆{a, b}∗ is defined as follows: Λ∈L; for every x and y in L, the strings axb, bxa, and x yare in L. Show that L =AEqB , the language of all strings x in {a, b}∗ satisfying n_a (x) =n_b (x).
Computer Science Find regular expressions for the following defined languages.over the alphabet Σ = {0, 1}:(i) Language of all strings having at least one 0 andat least one 1. (ii) Language of all strings that have at most two consecutive zeros.(iii) Language of all strings whose fifth symbol, from left to right, is a 1.to right, is a 1.(iv) Language of all strings of length even ≥ 2 formed by alternating zeros and ones.by alternating zeros and ones.(v) Language of all strings whose length is ≥ 4.(vi) Language of all strings of odd length that have ones only in the odd positions.ones only in the odd positions.(vii) Language of all strings whose length is a multiple of three.three.(viii) Language of all strings that do not contain three consecutive zeros.(ix) Language of all strings that do not contain four consecutive zeros.consecutive zeros.!(x) Language of all strings that do not contain the substring101.
Let regular language L1 recognized by DFA (Q1,Σ,δ1,s1,F1) and regular language L2 recognized by DFA (Q2,Σ,δ2,s2,F2). We will construct a product DFA as the quintuple (Q,Σ,δ,s,F) where: •Q=Q1×Q2•For allx∈Σ and (q1,q2)∈Q1×Q2,δ((q1,q2),x) = (δ1(q1,x),δ2(q2,x))•s= (s1,s2) DetermineFso that the product DFA recognizes: (i)L1∪L2(ii)L1∩L2(iii)L1\L2Based on your choice for F, for each case, provide a detailed proof why the product DFA recognizes each of the mentioned languages. Conclude that in-tersection of two regular languages is a regular language and set-theoretic dif-ference of two regular languages is regular.
Let regular language L1 recognized by DFA (Q1,Σ,δ1,s1,F1) and regular language L2 recognized by DFA (Q2,Σ,δ2,s2,F2). We will construct a product DFA as the quintuple (Q,Σ,δ,s,F) where: •Q=Q1×Q2•For allx∈Σ and (q1,q2)∈Q1×Q2,δ((q1,q2),x) = (δ1(q1,x),δ2(q2,x))•s= (s1,s2) Suppose we have a DFA that recognizes concatenation of two languages L1 L2. Also suppose we have a DFA that recognizes L2. Using these two DFAs, can we construct a new DFA to recognize L1? If yes, construct it.If no, explain why.
For each of the following languages L, state whether L is regular, context-free but not regular, or not context-free and prove your answer. {ww where w∈Σ^*} {a^n b^m where n≠m} {〖(ab)〗^n a^n b^n,n≥0}
Question 2 c) Give a regular expression for the following regular languages, assuming the alphabet is Σ := {0, 1}. I. The set of all strings, when viewed as binary representation of integers, that are divisible by 2. II. The set of all strings containing 00. III. Give a closed-form regular expression for the set of all string not containing consecutive 00.
Please dont copy or use chegg answeres. Please! Also explain Let Σ = {a, b, c} and define the finite languages L1 = {, aa, ab, ca, bab, bba, ccc} L2 = {a, c, ca, ccc} L3 = {c, ba, bab, bba, abc}. 1. (L1 ∪ L3) \ (L1 ∩ L2) 2. (L2 ∩ L3)L1
Formal Languages and Automata Theory Give context-free grammars that generate the following languages. In all parts, thealphabet Σ is {0,1} a. {w| w contains at least three 1s}b. {w| w starts and ends with the same symbol}c. {w| the length of w is odd}Ad. {w| the length of w is odd and its middle symbol is a 0}e. {w| w = wR, that is, w is a palindrome}f. The empty set
Consider the following languages over the alphabet Σ = {a, b}: 1. L1 = {xwx : x, w ∈ Σ∗}2. L2 = {xwx : x, w ∈ Σ∗, |w| = 1}3. L3 = {xwx : x, w ∈ Σ∗, |x| = 1} For each language, decide whether it is regular or not regular. Prove each of your claims. If you construct a FA or a regular expression, you do not need to prove the correctness of your construction.
1. Give a CFL for the language L (over the alphabet {a, b}), where L = {w | w has exactly the same number of a's as b's.}2. Draw a nondeterministic PDA for the language from the previous question.