Use undecidability of allcfg to show problem is undecidable

Assignment Help Theory of Computation
Reference no: EM1387003

Let the following problem ALLCFG: Given CFG G, is L(G) = Σ*? This problem is undecidable. (You do not have to prove this).

(a) Is this problem in RE (class of recursively enumerable languages), in core (class of all languages whose complement is in RE), in both, or in neither? Describe your answer.

(b) Use undecidability of ALLCFG to illustrate that following problem is also undecidable: Given PDA M1 and FA M2, is L(M1) = L(M2)?

Reference no: EM1387003

Questions Cloud

Importance of monetary rewards : How does culture affect the importance of monetary rewards? Provide an example to support your position.
What theory or theories of motivation might describe change : Supporting his theory, since 2001, workers in the United States have enhancement their hours worked while tax rates have dropped. What theory or theories of motivation might describe such a change.
Examine various transfer pricing scenarios which tech sonic : Examine various transfer pricing scenarios which Tech Sonic might adopt and the likely impact of each on the Tech Sonic subsidiaries as well as the parent corporation.
Discuss which concepts are the most important : Discuss which concepts are the most important to consider when designing information security policies and procedures.
Use undecidability of allcfg to show problem is undecidable : Use undecidability of ALLCFG to illustrate that following problem is also undecidable: Given PDA M1 and FA M2, is L(M1) = L(M2)?
Illustrate what environmental factors would have the most : Illustrate what environmental factors would have the most impact on these companies? Illustrate what ratio of environmental scanning to internal analysis should each employ
Indicate the genotype and phenotype parent of and offspring : Explain a specific example of a cross between two parents, each homozygous for different traits, which would result in a phenotype that is distinct from either parental phenotype.
Length of time patron spend at the gymnasium : The manager of a local gymnasium has determined that the length of time patron spend at the gymnasium is normal distributed with mean 80minutes and standard deviation 20 minutes. What is the patrons who spend more than 120 minutes at the gymnasium..
Distinguish between a minimization and maximization lp model : Distinguish between a minimization and maximization LP model. How do you know which of these to use for any given problem?

Reviews

Write a Review

Theory of Computation Questions & Answers

  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

  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

  Front end and back end processes of office automation

Discuss the difference between the front end and back-end processes of office automation? Provide some examples in your workplace or that you come into contact with?

  Rice-s theorem for enumerable or non-re

We know by rice's theorem that none of the following problems are decidable. However,are they recursively enumerable,or non-RE? IS L(M) infinite?

  Create a recursive java method maximum

Create a recursive java method maximum that calculate the maximum element of a linked list of integers.The solution must be simplified and should not use class Node or head

  Design turing machine having at least four nontrivial states

Design Turing machine (using Sipser notation) having at least 4 nontrivial (i.e., nonrejecting) states and at least six nontrivial (i.e., not to the rejecting state) transitions.

  Why every nonempty propositional clause itself satisfiable

Describe why every nonempty propositional clause, by itself, is satisfiable. Prove rigorously that every set of five 3-SAT clause is satisfiable, given that each clause mentions exactly three distinct variables.

  Argue that the problem is np complete

Argue that the following prob is NP Complete. Given list of positive integers, u1,u2,...un (in binary representation) and asked if there is partition of this set into 3 subsets, each of which has same sum.

  Write grammar for language comprising of strings

Write down the grammar for language comprising of strings which have n copies of letter a followed by same number of copies of letter b, where n > 0.

  Compute a shortest superstring

Dynamic programming algorithm to compute a shortest superstring.

  Deterministic finite and non-deterministic finite automata

Describe the difference between a Deterministic Finite Automata and Non-Deterministic Finite Automata. In general, which one is expected to have less number of states ?

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