Question 3. a) Consider the following language. Design a PDA to recognize the language. L={wwR| w E {a, b}*} b) Use your designed PDA to discuss whether the string s-abba belongs to L or not. Justify your answer. c) Also, examine whether string s-abab belongs to L or not. Why?

Question 3. a) Consider the following language. Design a PDA to recognize the language. L={wwR| w E {a, b}*} b) Use your designed PDA to discuss whether the string s-abba belongs to L or not. Justify your answer. c) Also, examine whether string s-abab belongs to L or not. Why?

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

Note: I don't need coding I need a solution . Please provide a complete solution. And please be hurry. I will definitely give you thumbs up Question 5: CFG Make a CFG for the language a3nbm(aba)2mbn, where n,m>0 Make a DFA that accepts all words that start with ‘aab’, and then convert the DFA to a CFG using the simple procedure we did in class.
Let Cbe the language over {a, b,c, d, e, f} accepting all strings so that: 1.There are precisely two b’s in the string. 2.Every a is immediately followed by an odd number of e’s. 3.Every d is immediately followed by an even number of f’s. 4.e’s and f’s don’t occur except as provided in rules 2 and 3. 5.All a’s occur after the first b. 6.All d’s occur before the second b. 7.In between the two b’s there are exactly twice as many a’s as d’s.HINT: Don’t be intimidated by the number of rules. The way they interact actually helps you simplify the number of cases you have to deal with while constructing this grammar. a. Construct a context-free grammar generating C.Explain how your construction accounts for each rule. b. We could eliminate one rule from Cand make it regular. Which rule would that be, and why would it work? You do not need a formal proof, but you do need an explanation.
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".
3. | Based on the given PDA, choose the right answer for the definition of the Language, L = {wcw® [w€ {a,b}*} a,&/A b,&/B a,A/t b,B/E -8 (C.E/E), a,A/ɛ b,B/e 4. O b. a,ɛ/A b,e/B Oc ஆ (e,e/e) a, N b,AA. b,AJA. a,e/X -8 ம் ee/e Choose the suitable PDA for the following Language, L = {a*b*c•d* | m + n = p +q}. Oa (a,ex) (b,X/z) (c,eY) (d,Y/c) -3 (SW/el Ble.em Bi¢.Y/a)S Ob (a,&/x) -8B :Bve glaxa 8 (b,5X) (c,X/6) (d,X/c) (b,ax Oc (a,t/X) (b,æY) (c,Y/c) (d,X/c) (b,a) (d,X/t) Od (a,2/A) (b,z/A) 86 b,X/e (ee/e) (e,e/t) (c,e/A) (e,e/e) (d,A/e)
Q. Construct DFA’s for FollowingWhen  = {0, 1}v. Machine that accepts the language which has either odd number of 0’s or even number of 1’s but not both together .vi. Machine that accepts the language which has both 01 and 10 as substring .vii. Machine that accepts the language which has neither 00 nor 11 as a substring.
Consider the following regular expression r: b(a + ab)' ab Which of the following words are in the language defined by r? baabaa baab bbb ba
Question 2: DFAS For this question take E={a,b} (a) Make a DFA (state-diagram), that accepts all words that start with either 'ab' , or with 'aba', and end with the same pattern they started with. (b) Make a DFA that accepts all words that include the pattern "babaa" (c) Make a DFA that accepts all words that include the pattern "babaa" an odd number of times.
I need help with my program. It needs to: Developing a language model based on the context-free grammar: Use the context-free grammar to develop a language model that can be used to generate coherent and grammatically correct sentences in American English. Incorporating semantic information into the context-free grammar: Expand the context- free grammar to incorporate semantic information, such as word meaning and context, to generate more meaningful sentences in American English. import java.util.*;import java.util.stream.Collectors;public class CFG { private static Map<String, List<String>> rules; public static void main(String[] args) { rules = new HashMap<>(); initializeGrammarRules(); String sentence = generateSentence("S"); System.out.println(sentence); } private static void initializeGrammarRules() { rules.put("S", Arrays.asList("NP VP")); rules.put("NP", Arrays.asList("Det N", "Det AP N"));…
Thank you in advace for quick response for both questions. Thanks 1. Build a FA that accepts the language of strings, over alphabet {a, b}, that start with a followed by b or with b followed by a and that end with a. Problem 4: 2. Build a TG that accepts the language of strings, over alphabet {a, b}, that start with ab and end with ba or those that start with ba and end with ab.
Please written by computer source 1) Write truth tables for the statement forms in A.∼p ∧ q B. p ∧ (q ∧ r) 2) Determine whether the statement forms are logically equivalent. In each case, construct a truth table and include a sentence justifying your answer. Your sentence should show that you understand the meaning of logical equivalence. 1. p ∨ (p ∧ q) and p 2. p ∨ t and t 3. (p ∧ q) ∧ r and p ∧ (q ∧ r) 4. (p ∧ q) ∨ r and p ∧ (q ∨ r) 3) Assume x is a particular real number and use De Morgan’s laws to write negations for the statements 1. −2 < x < 7 2. x < 2 or x > 5 3. 1 > x ≥ −3 4) Use truth tables to establish which of the statement forms are tautologies and which are contradictions. 1. (p ∧ q) ∨ (∼p ∨ (p ∧ ∼q)) 2. (p ∧ ∼q) ∧ (∼p ∨ q) 5) In the below, a logical equivalence is derived from Theorem 2.1.1. Supply a reason for each step. (p ∧ ∼q) ∨ (p ∧ q) ≡ p ∧ (∼q ∨ q) by (a) ≡ p ∧ (q ∨ ∼q) by (b) ≡ p ∧ t by (c) ≡ p by (d) Therefore, (p ∧ ∼q) ∨ (p ∧ q) ≡ p. 6) Use…
1. Find a pda that accepts the language L = {a"b²n : n > 0}.
Hi, I'm seeking help with part E of question 1.7. I find it confusing and am unsure of how to start. The issue revolves around a state diagram. Could you offer a visual representation, such as drawing circles, to aid my comprehension? My request specifically pertains to assistance with 1.7 part e. This is the problem that I need help with:1.7 E : E) The language 0 ∗ 1 ∗ 0 + with three states