Construct a regular expression

Assignment Help Theory of Computation
Reference no: EM132163919

Q1. For the NFA N given below, using the powerset construction, construct a DFA M that accepts the same language accepted by N. Do not include states which are not reachable from the initial state of your DFA. Do not simplify your DFA and for each state in the constructed DFA, label it with a subset of all states of N in the usual way.

343_figure.jpg

Q2. Consider the following NFA:

1849_figure1.jpg

The goal is to construct a regular expression the accepts the same language as the above NFA.

(a) Draw the NFA after adding the new i and the a states as stated in the initialization of the algorithm to compute the regular expression.

(b) Continuing (a), draw the NFA (with regular expressions as labels) after you remove qo.

(c) Continuing (b), draw the NFA (with regular expressions as labels) after you remove q1.

(d) Continuing (c), draw the NFA (with regular expressions as labels) after you remove q2.

(e) Continuing (d), draw the NFA (with regular expressions as labels) after you remove q3.

(f) Continuing (e), draw the NFA (with regular expressions as labels) after you remove q4.

Q3. Let L, L' be two languages over Σ Define
T(L, L') = {c1c'1c2c'2....cncn' | ci ∈ Σ, C'i ∈ E, ci' ∈ Σ, c1, c2, cn cn, ∈ L, and c'1c'2....c'n ∈ L'}

Prove that if L, L' are regular, then T(L, L') is also regular. This means that you have to assume L has a DFA say (E, Q, q0, F, δ) and L' has a DFA say (E, Q, q0, F, δ), you then construct a DFA for T(L, L'). To show that you understand the question, you are advised to provide one or two specific examples for L and L' and then state what you get when you construct T(L.L') using your method.

NOTE: The style of this question and the expected answer is similar to other closed operator construction from class. For instance we have the complement construction, the cross product construction and also the powerset construction.

Reference no: EM132163919

Questions Cloud

Calculate the schedule variance-schedule performance index : Calculate the schedule variance, schedule performance index, and cost performance index for the project to date.
What information is provided under the vulnerabilities tab : Using a web browser, visit securityfocus website, what is Bugtraq, and how would it be useful? what additional information is provided under the Vulnerabilities
Describe three most common performance management systems : Describe the three most common performance management systems that can be used for a companies strategic growth.
Identify and define virtual worker roles : Assess whether or not the Water Cube project management team achieved the selected enhancers. Identify specific examples to justify your assessment.
Construct a regular expression : Construct a regular expression the accepts the same language as the above NFA - cross product construction and also the powerset construction
What performance standards and expectations : What performance standards and expectations does the organization need to set for our expats abroad?
Fiedler contingency theory-house path-goal leadership theory : Discuss how you would apply Fiedler's Contingency Theory, House's Path-Goal Leadership Theory,
Evaluation and analysis supported with concepts described : The research study can, for example, include the following: Evaluation & Analysis, supported with concepts described in the course and outside research
Does it make sense to use the tit-for-tat rule when dealing : Does it make sense to use the "tit-for-tat" rule when dealing with personal friends and family members?

Reviews

Write a Review

Theory of Computation Questions & Answers

  Conflict between the team membersrod edwards the

conflict between the team membersrod edwards the advertising manager for waterlite advertising and associates has two

  Give a table of combinations for the boolean function

Consider the Boolean algebra of four elements {o, 1, a, b} specified lby the following operation tables and the Boolean functionj(x,y) = ax + by where a and b are two of the elements in the Boolean algebra .Writej(x,y) in a sum-of-minterms form.

  Show that there is no language s

Show that there is no language S such that S* is the language of all strings of a's and b's that do not contain the substring bb.

  Characterize the subgame perfect nash equilibria

Characterize the Subgame Perfect Nash Equilibria of this game. Discuss the underlying assumptions made in the analysis.

  Abstract - a coinductive calculus of binary trees

We study the set TA of infinite binary trees with nodes labelled in a semiring A from a coalgebraic perspective. We present coinductive definition and proof principles based on the fact that TA carries a final coalgebra structure.

  Question 1 given the productionss-gt sa aaa absa-gt acaa

question 1. given the productions.s-gt sa aaa absa-gt acaa list the parse table. is the grammar ll1 in this form? if

  Construct a finite-state automaton

A combination lock for a safe is designed based on two symbols only, 0 and 1. The combination that opens the safe consists of exactly four symbols.

  Prove the pumping lemma

One important technique used to prove that certain sets are not regular is the pumping lemma. The pumping lemma states that if M = (S, I, f, s0,F).

  Define what is the deterministic finite-state automaton

Find a deterministic finite-state automaton that recognizes the same language as the nondeterministic finitestate automaton in Exercise.

  Minimum state finite automaton for the language

Find the minimum state finite automaton for the language specified by the finite automaton

  Prove the inference rules for functional dependencies

A proof should be made by using the reflexive, augmentation, transitive, decomposition, union, and pseudotransitive rules.

  The latest entry into the snack food industry

The latest entry into the snack food industry is a health-conscious offering named Hooks, Wheels, and Ladders. Each box mixes several flavors, such as ranch, cheddar, and salsa. The snack is designed to appeal to kids based on the snack shapes

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd