Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

1. a) Design an NFA to support the following three strings for searching over the alphabet {w, e, d, Last Two letters of your grandfather

image text in transcribed

1. a) Design an NFA to support the following three strings for searching over the alphabet {w, e, d, Last Two letters of your grandfather name, Last two letters of your name} wed, we+ Last Two letters of your grandfather name, we +Last two letters of your name My Name : Md. Shafiul Alam Bhuiyan and My Grandfather Name: Md. Paharchand Bhuiyan b) Draw a Transition Table for the NFA of Question 1(a). c) Convert your NFA of Question 1(a) to DFA. d) Using the DFA of 10, search the substring "wed" in the string "reviewed" 2. Write regular expressions for the following languages a)Language={Supports your name} My Name: Md. Shafiul Alam Bhuiyan 3. Write grammars for all the regular expressions using Language={Supports your name} My Name: Md. Shafiul Alam Bhuiyan

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Advanced Database Systems

Authors: Carlo Zaniolo, Stefano Ceri, Christos Faloutsos, Richard T. Snodgrass, V.S. Subrahmanian, Roberto Zicari

1st Edition

155860443X, 978-1558604438

More Books

Students also viewed these Databases questions

Question

Employ effective vocal cues Employ effective visual cues

Answered: 1 week ago