Write first four strings in lexicographic enumeration

Assignment Help Theory of Computation
Reference no: EM1357335

1) Consider the language L = L1 ∩ L2, where L1 = {ww^R : w ∈ {a, b}* and L2 = {a^n b*a^n: n ≥ 0}.

a) List the first four strings in the lexicographic enumeration of L?

b) Write a context-free grammar to generate L.

c) Show a natural pda for L.

d) Prove that L is not regular.

Reference no: EM1357335

Questions Cloud

Human resources- workforce mangement and development : Human Resources- Workforce mangement and development - choice for a workforce management and development strategy
Determine which ratios measures organization liquidity : Determine which of the following ratios measures an organization's liquidity also find which of the following ratios would tell an investor about the profitability of the organization?
Compute a fair price of this stock : A stock is expected to pay a dividend of $2.50 per share indefinitely. The stock is expected to generate a return of 8 percent in the foreseeable future. Based on this information, Compute a fair price of this stock.
How much heat flows through window per minute : What happens to the resistance of copper wire after dunking it in liquid nitrogen? and what happens to the resistance of a carbon resistor when you dunk it in liquid nitrogen.
Write first four strings in lexicographic enumeration : Consider the language L = L1 ∩ L2, where L1 = {ww^R : w ∈ {a, b}* and L2 = {a^n b*a^n: n ≥ 0}. Write the first four strings in the lexicographic enumeration of L?
Explain the level of significance : Explain At the 0.05 level of significance is there evidence of a difference in the daily customer count based on the price of a small coffee
Elucidate three political philosophie of redistributing wage : There has been much political discussion about redistributing income. These ideas are not new. Name and elucidate the three political philosophies of redistributing income. Do you believe any of them have merit.
Journal entry for depreciation-presentation : At the end of its first year, the trial balance of Eaton Company shows Equipment $30,000 and zero balances in Accumulated Depreciation?Equipment and in Depreciation Expense ?Equipment. Depreciation for the year is estimated to be $6,000.
Assume that the block is not moving initially : The 200 g head of a golf club moves at 40 m/s in a circular ARC of 1.2 m radius. How much force must the player exert on the handle of the club to prevent it from flying out of her hands at the bottom of swing? Ignore the mass of the club's shaft.

Reviews

Write a Review

Theory of Computation Questions & Answers

  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

  Proving language to be pumping lemma

Show that the language F = {a^i b^j c^k | i, j, k greater than or equal to 0 and if i = 1 then j = k} is not regular. Show, however, that it satisfies the statement of the pumping lemma

  Create standard 1-tape turing machine to calculate function

Create a standard 1-tape Turing machine M to calculate the function sub3. Specifically, calculate sub3 of a natural number represented in binary.

  Explain declarative knowledge and procedural knowledge

Write some examples of declarative knowledge. Write some examples of procedural knowledge. Then, compare examples, highlighting the similarities & differences.

  If l recognized by dfa then language left half is regular

We showed to prove that if L can be identified by DFA then the language left half(L) = {x ∈ ∑*|∃y xy ∈ L and |x| = |y|} is also regular; here |x| means length of x.

  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.

  Express set as regular expression

Express the following set as a regular expression: The set of all strings of length at least three over {0,1} such that every three consecutive.

  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.

  Compute a shortest superstring

Dynamic programming algorithm to compute a shortest superstring.

  Redundant sequence identi cation

Redundant sequence identi cation

  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).

  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

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