Let
a) Show that 111000 belongs to the language generated by G.
b) Show that 11001 does not belong to the language generated by G,
c) What is the language generated by G?
Want to see the full answer?
Check out a sample textbook solutionChapter 13 Solutions
DISCRETE MATHEMATICS LOOSELEAF
- Let A, B and C be 3 languages over the same alphabet: AtLeast2(A.B.C) = {w|w is in at least 2 of the 3 languages A, B and C } Show that if A, B and C are regular languages, then so is AtLeast2(A.B.C). Hint: Write "AtLeast2(A,B,C)" in the form of some set operations (intersection, union, complement,.) on "A", "B", and "C". Then use closure properties of regular languages.arrow_forward14 Below is the state diagram for an NFA N. В 1 start A a) Which of the following strings are accepted by N? (Simply write "accept" or "reject" after each.) • 101 • 0100 • 0101 • 0011 • 1001 • 01100 b) Design a DFA that accepts the same language as N using a general method that works for all NFAS. c) Construct a regular grammar for this language using a general method that works for all NFAS.arrow_forwardN-{B, C, D) T= { b, c, d } P= the productions 1. BbBCD 2. BbcD 3. DC-> CD 4. CCCC 5. CD-> cd 6. dD -> dd S-B With the above context-sensitive grammar, which of the following identifiers would be valid from left to right separated by single spaces? cbd bbcdd bbbcccddd bcd bbbbccccdddarrow_forward
- Prove that the following grammar is ambiguous-V:{S}∑:{id,+,*}P: S->S+S/S*S/idS:{S}arrow_forward3) Let M be the set of all the words you can get by switching the letters in ENANNANANANAS How many words in M contain neither ANAS nor ENA? For example. SNANNANANANAE Bad words are for example ENANNANANANAS, SENANNANANANA, and NNNNENANASAAA.arrow_forwardWhich of the following sets of connectives are expressively adequate? →, ¬, A →, +, V 7,V ^, Varrow_forward
- Let A be the language recognized by the given DFA and let ai ∈ {0, 1}.Design a DFA for the language below: a1a2a3a4 · · · a2n : a2a4 · · · a2n ∈ Aarrow_forwardThe binary operation * is defined on the set of R by a * b = (a + b) / (a – b). What is a * b if a = 3 and b = 2? * a. 3 b. 4 c. 5 d. 6arrow_forwardFill in the blanks below for the computation of 7 div 2 using the computational grammar in Example 9-4: S1 →T T1 → 1S TS → 1 SS → A => => => => => => => =>arrow_forward
- Let N= {1, 2, 3, 4, .} be the set of natural numbers and S= (1, 4, 9, 16, ...} be the set of squares of the natural numbers. Then N - S, since we have the one-to-one correspondence 1 + 1, 2 + 4, 3 + 9, 4 + 16, ... n+ n?. (This example is interesting, since it shows that an infinite set can be equivalent to a proper subset of itself.) Show that each of the following pairs of sets are equivalent by carefully describing a one-to-one correspondence between the sets. Complete parts (a) through (c) below. (a) The whole numbers and natural numbers, W = {0, 1, 2, 3, ..} and N= {1, 2, 3, 4, ...} Which of the following describes a one-to-one correspondence between the two sets? O A. For each element in W, there is an element in N that is double that element. O B. For each element in w. there is an element in N that is 1 areater than double that element.arrow_forwardLet S be the set of bit strings of length four or more. For example, 100111 € S, 00111100 e S, or 1011 e S. Let R = {(x, y)|x € S,y e S, and x, y agree on their first four bits}. For example, (1010111, 1010010) e R but (10010111, 110010) ¢ R. Show that Ris an equivalence relation on S. What are the equivalence classes of the bit string 11110101arrow_forward2) Let K be any Boolean algebra. A useful relation × ≤ y (read as “x precedes y” ) if and only if xy=x. i) ii) iii) a) If K is the Boolean Algebra of subsets of a set S, to what familiar relation on the subsets of S does Correspond? Refer to example 7.1 in page 348 in the textbook b) Use the axioms and laws of Boolean algebra to prove the following properties of ← in an arbitrary Boolean algebra K. Make sure that when you use the axioms or laws, write that down in the proof x < x for all x € K (Reflexive property) If xy and y If x can be defined as the elements of K as follows: y and y x, then x=y (Antisymmetric property) z, then x z (Transitive property)arrow_forward
- Discrete Mathematics and Its Applications ( 8th I...MathISBN:9781259676512Author:Kenneth H RosenPublisher:McGraw-Hill EducationMathematics for Elementary Teachers with Activiti...MathISBN:9780134392790Author:Beckmann, SybillaPublisher:PEARSON
- Thinking Mathematically (7th Edition)MathISBN:9780134683713Author:Robert F. BlitzerPublisher:PEARSONDiscrete Mathematics With ApplicationsMathISBN:9781337694193Author:EPP, Susanna S.Publisher:Cengage Learning,Pathways To Math Literacy (looseleaf)MathISBN:9781259985607Author:David Sobecki Professor, Brian A. MercerPublisher:McGraw-Hill Education