Two-tape turing machine, Theory of Computation

Assignment Help:

Let there L1 and L2 . We show that L1 ∩ L2 is CFG .

Let M1 be a decider for L1 and M2 be a decider for L2 .

Consider a 2-tape TM M:

"On input x:

1. copy x on the second tape

2. on the ?rst tape run M1 on x

M=

3. if M1 accepted then goto 4. else M rejects

4. on the second tape run M2 on x

5. if M2 accepted then M accepts else M rejects."

The machine M is a decider and it accepts a string x i? both M1 and M2 accept x.

Two-tape TM is as expressive as the single tape TM.

The process is as follows

"Given a CFG G and a string w , does G generate w ?

Language Formulation (Acceptance Problem for CFG) def

ACFG = {?G , w ? | G is a CFG, w a string and w ∈ L(G )}

The language ACFG is decidable.

 Construct a decider M for ACFG :M = " 1. On input x check if x = ?G , w ? where

G is an CFG and w is a string, if not then M rejects.

2. Convert G into Chomsky normal form.

3. List all derivations in G of length exactly 2|w | - 1,

if w = ? then check if there is the rule S → ?.

4. If w is ever generated then M accepts, else M rejects."


Related Discussions:- Two-tape turing machine

Data retriving, i have research method project and i meef to make prposal w...

i have research method project and i meef to make prposal with topic. If this service here please help me

Suffix substitution closure, Our primary concern is to obtain a clear chara...

Our primary concern is to obtain a clear characterization of which languages are recognizable by strictly local automata and which aren't. The view of SL2 automata as generators le

Gephi, construct a social network from the real-world data, perform some si...

construct a social network from the real-world data, perform some simple network analyses using Gephi, and interpret the results.

Strictly 2 - local automata, We will assume that the string has been augmen...

We will assume that the string has been augmented by marking the beginning and the end with the symbols ‘?' and ‘?' respectively and that these symbols do not occur in the input al

Alphabets - strings and representation, A finite, nonempty ordered set will...

A finite, nonempty ordered set will be called an alphabet if its elements are symbols, or characters. A finite sequence of symbols from a given alphabet will be called a string ove

Turing, turing machine for prime numbers

turing machine for prime numbers

What is pumping lemma for regular sets, State & prove pumping lemma for reg...

State & prove pumping lemma for regular set. Show that for the language L={ap |p is a prime} is not regular

Dfa to re, c program to convert dfa to re

c program to convert dfa to re

Automata answer, build a TM that enumerate even set of even length string o...

build a TM that enumerate even set of even length string over a

Write Your Message!

Captcha
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