Question: Adjust the code below so that the transitions work as follows: Transactions must follow the pattern below, e . g . ( current state, symbol

Adjust the code below so that the transitions work as follows:

Transactions must follow the pattern below, e

.

.

(

current state, symbol read

) - > (

new state, action

)

the action can be write

/

read

,

move right or left

transicao

= {

('

0','

')

('

1','

'),

('

0','

')

('

1','

'),

('

0','_')

('

','_'),

('

0',' >')

('

0','

',),

('

1','

')

('

0','

'),

('

1','

')

('

0','

'),

('

1','_')

('

0','

'),

('

1',' >')

('

1','

')

}

Here is the code to fix:

class MaquinaTuring:

def

__

init

__(

self

,

states, alphabet, tape

_

alphabet, initial

_

state, blank

_

symbol, final

_

states, transitions, start

_

marker

)

self.states

=

states

self.alphabet

=

alphabet

self.tape

_

alphabet

=

tape

_

alphabet

self.initial

_

state

=

initial

_

state

self.blank

_

symbol

=

blank

_

symbol

self.final

_

states

=

final

_

states

self.transitions

=

transitions

self.start

_

marker

=

start

_

marker

self.configurations

= []

def run

(

self

,

input

_

string, max

_

transitions

= 100)

self.initial

_

configuration

= (

self

.

initial

_

state, self.start

_

marker

+

'aabbba'

+

self.blank

_

symbol,

1)

self.configurations.append

(

self

.

initial

_

configuration

)

tape

= [

self

.

start

_

marker

] +

list

(

input

_

string

) + [

self

.

blank

_

symbol

]

head

= 1

state

=

self.initial

_

state

transitions

_

count

= 0

while state not in self.final

_

states:

if transitions

_

count

> =

max

_

transitions:

choice

=

input

("

Continue processing?

(

yes

/

)

")

if choice.lower

()! =

'yes':

break

symbol

_

under

_

head

=

tape

[

head

]

(

state

,

symbol

_

under

_

head

)

not in self.transitions:

("

Error: No transition defined for current state and symbol."

)

return

new

_

state, new

_

symbol, move

=

self.transitions

[(

state

,

symbol

_

under

_

head

)]

tape

[

head

] =

new

_

symbol

if move

= ='

'

head

+ = 1

elif move

= ='

'

head

- = 1

elif move

= ='

'

and symbol

_

under

_

head

= =

self.start

_

marker:

head

+ = 1

# Se ler o marcador de in

cio

,

move para a direita

state

=

new

_

state

transitions

_

count

+ = 1

# Armazenar a configura

o atual na lista

self.configurations.append

((

state

,'' .

join

(

tape

),

head

))

# Perguntar ao usu

rio se ele deseja ver todas as configura

show

_

configurations

=

input

("

Deseja visualizar todas as configura

es presentes na computa

,

desde o estado inicial at

a configura

o final?

(

sim

/

)

")

if show

_

configurations.lower

() = =

'sim':

for i

,

config in enumerate

(

self

.

configurations

)

(

"

Configura

{

}

")

(

"

Estado:

{

config

[0]} ")

(

"

Fita:

{

config

[1]} ")

(

"

Cabe

a de leitura

/

escrita na posi

{

config

[2]} ")

(" - - - ")

return state,

'' .

join

(

tape

)

# Exemplo de uso:

'''

estados

= {'

0','

1','

2'}

alfabeto

= {' 0',' 1'}

alfabeto

_

fita

= {' 0',' 1','

','

','_',' >'}

estado

_

inicial

='

0'

espaco

_

branco

='_'

estado

_

final

= {'

2'}

transicao

= {

('

0',' 0')

('

1','

','

'),

('

0',' 1')

('

0',' 1','

'),

('

0','_')

('

2','_','

'),

('

0',' >')

('

0',' >','

'),

('

1',' 0')

('

1',' 0','

'),

('

1',' 1')

('

1',' 1','

'),

('

1','_')

('

2','_','

')

}

'''

estados

= {'

0','

1'}

alfabeto

= {'

','

'}

alfabeto

_

fita

= {'

','

','_','

'}

estado

_

inicial

='

0'

espaco

_

branco

='_'

estado

_

final

= {'

'}

transicao

= {

('

0','

')

('

1','

','

'),

('

0','

')

('

1','

','

'),

('

0','_')

('

','_','

'),

('

0',' >')

('

0',' >','

'),

('

1','

')

('

0','

','

'),

('

1','

')

('

0','

','

'),

('

1','_')

('

0','_','

'),

('

1',' >')

('

1',' >','

')

}

=

TuringMachine

(

estados

,

alfabeto, alfabeto

_

fita, estado

_

inicial, espaco

_

branco, estado

_

final, transicao,

' >')

#estado

_

final, fita

_

final

=

.

run

(' 11011011')

estado

_

final, fita

_

final

=

.

run

('

aabbba

')

("

Estado final:", estado

_

final

)

("

Fita final:", fita

_

final

)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Adjust the code below so that the transitions work as follows: transicao = { ( ' q 0 ' , ' a ' ) : ( ' q 1 ' , ' b ' ) , ( ' q 0 ' , ' b ' ) : ( ' q 1 ' , ' a ' ) , ( ' q 0 ' , ' _ ' ) : ( ' h ' , '...

you are asked to write three programs (for Questions 1.2.9, 1.2.10 and 1.2.11) that compute the answers. Note: your outputs should match the results that are given in the answers provided; as long as...

1. - Expain the motivations of Unilever in acquiring Inmarko. - Identify the risks Unilever faces in using acquisition as a mode for growth, as opposed to other modes discussed in the chapter. 2....

A creative engineer suggests structuring the TLB so that not all the bits of the presented address need match to result in a hit. Suggest how this might be achieved, and what might be the costs and...

Java, will thumbs up Over and over again we will see the same kind of thing: that even though the underlying rules for a system are simple, and even though the system is started from simple initial...

I need help with this essay. Performing tax research to find correct answers to a given tax situation and composing memoranda summarizing these findings are important parts of tax practice. As...

How to incorporate the following into a final argumentative essay Adopt Don't Shop The research subject I chose for my final argument paper is "Should people adopt animals instead of buying them from...

C++ Write a recursive descent parser for the Snowflake language. The program should use the lexical scanner you wrote for an earlier assignment. When combined with the lexical scanner, your parser...

I've attached the quesiton as a word file, thanks! JWCL165_c11_506-567.qxd 8/12/09 7:54 AM Page 506 11 Corporations: Organization, Stock Transactions, Dividends, and Retained Earnings Chapter STUDY...

What are several trends that are occurring in computer peripheral devices? How do these trends affect business uses of computers?

Suppose that instead of funding the $300 million investment in 8 percent British loans with U.S. CDs, the FI manager funds the British loans with $300 million equivalent one-year pound CDs at a rate...

9 Every year, Patrick shares 280 oranges between his children in the ratio of their ages. This year, the children are 3, 7 and 10 years old. How many more oranges will the youngest child receive in...

Sipser Book Please type the answer not by hand writing, it is not understandable. *6.24 Show that EQTm Em EQTM

8. Do you believe that others can compete but that they also can choose to cooperate? __ always __ usually __ occasionally __ seldom __ never true?

3. Would you say that effective teamwork saved their lives?

6. Do you believe that differences of opinion are helpful and beneficial? __ always __ usually __ occasionally __ seldom __ never true