User Account

All Pages

Minimum state finite automaton for the language

Assignment Help Theory of Computation
Reference no: EM13926749

1. Consider the deterministic finite automaton M = ({q1, q2 , q3}, {0, 1}, δ, q1, {q2}) where δ is defined as follows:

δ(q1, 0) = q1 δ(q1, 1) = q2 δ(q2, 0) = q3 δ(q2, 1) = q2 δ(q3, 0) = q2 δ(q3, 1) = q2

Write an equivalent regular expression.

2. Prove that the following languages are not regular sets:

(a) L = {ai bj ck | i = 0 ∨ j = k, i, j, k ≥ 0}. Example strings include bccc, abbcc, aaa, etc.

(b) L = {ww | w ∈ {0, 1}

Example strings include 00, 11, 0101, 010010, etc.

(c) L = {a2

|n ≥ 0}. Example strings include aaaa, a16 , a64 , etc.

(d) L = {w | w ∈ {0, 1}∗, w is of the form (0i 1)n , for i = 1, 2, ..., n, n ≥ 0}. The strings of this language are ε, 01, 01001, 010010001, ...., each successive string of 0's being one larger than the previous.

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

M = ({q0, q1, q2, q3}, {0, 1}, δ, q0, {q0 }) where δ is defined as follows:

Reference no: EM13926749

Questions Cloud

Five steps of hypothesis testing : He recorded the store's sales for those four Wednesdays and then recorded the store's sales for the four alternate Wednesdays, when the signs were not displayed. On the Wednesdays with the sign, the sales were 83, 73, 81, and 79. On the Wednesdays..
Prepare a performance report using spreadsheet software : Application: Using Performance Reports to Inform Organizational Decisions, Prepare a performance report using spreadsheet software, such as Excel. Hint: Read the Weekly Briefing and watch the Performance Report video on this topic
Compute the amount of each of the end-of-year payments : Compute the amount of each of the end-of-year payments. Prepare a loan amortization schedule detailing the amount of principal and interest in each year's payment.
Confidence interval estimate for mean head circumference : Find a 95% confidence interval estimate for the mean head circumference of all two-moth old babies. What aspect of this problem is not realistic?
Minimum state finite automaton for the language : Find the minimum state finite automaton for the language specified by the finite automaton
Set theory-relations-functions and sequences : Look up a roulette wheel diagram. The following sets are defined:
Sets of data and explore ways of analyzing that data : we are going to look at sets of data and explore ways of analyzing that data so that conclusions can be made from that data. Now, it is possible to have a data set that has many as 100 data points or even 1000's of data points. We need to summa..
Write a non-recursive function vowels : Write a non-recursive function vowels() that accepts a character string and counts and returns the number of vowels (aeiou) in the string.
Present value of the hotel terminal value : Assume that the $450 million expense of building the hotel can be written off straight line over a 30-year period (the other $150 million is for the land which is not depreciable) and that the present value of the hotel's terminal value will be $2..

Reviews

Write a Review

Theory of Computation Questions & Answers

  Finite-state machine design

Create a finite-state machine design to turn your FPGA development board into a simple programmable music box.

  Redundant sequence identi cation

Redundant sequence identi cation

  Compute a shortest superstring

Dynamic programming algorithm to compute a shortest superstring.

  Propositional and predicate logic

Write down a structural induction principle for the PlayTree free type

  Design a syntactic analyzer

Design a syntactic analyzer for the language specified by the grammar

  Design unambiguous grammar to parse expressions

Write a program would read two numbers and then print all numbers between the first and the second, inclusive. Design unambiguous grammar to parse expressions

  Consider a logic function with three outputs

Consider a logic function with three outputs,  A ,  B , and  C , and three inputs,  D ,  E , and  F . The function is defined as follows:  A  is true if at least one input is true,  B  is true

  Considering a single programmed operating system

Considering a single programmed operating system, what is the minimal total time required to complete executions of the two processes? You should explain your answer with a diagram.

  How to construct an nfa

Give a construction that assumes you are given a DFA for L and show how to construct an NFA (with or without ε-moves) to recognize sort(L).

  Equivalence classes to construct minimal dfa for language

How many equivalence classes does this relation have and what are they? Use these equivalence classes to construct the minimal DFA for the language.

  Impact of moore-s law on data center costs

Discuss the impact of Moore's law on data center costs on such things as servers and communications equipment. List at least 3 steps or recommendations your data center can take to offset some or all of the effect of Moore's law.

  Problem encountered in statements in predicate logic

How the problem would be encountered in attempting to represent the following statements in Predicate logic. it should be possible to: John only likes to see French movies.

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!

Submit Assignment

Academics

Major Subjects

Majors

Get In Touch

whatsapp: +1-415-670-9521

Phone: +1-415-670-9521

Email: [email protected]

TERMS & POLICIES

HELP & SUPPORT

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