Homework Answers
2) The Turing machine accepts the string with odd number of 1's
Add Answer to:
7.(10%) Give the Turing machine as shown below. 1) Examine the following strings are recognized or...
What is the language of accepted strings by the below Turing machine? {a*b*} {ambn | m,...
What is the language of accepted strings by the below Turing
machine?
{a*b*}
{ambn | m, n ≥ 0}
{ambm | m ≥ 0}
{ambnam | m,
n ≥ 0}
This Turing machine is non-deterministic, so it cannot accept a
deterministic language.
( R) go 9 q 93 (9,X, R) (91a, R) (qa, a, L) (hra, R) (h. b, R) (92. y, L) Ø (h. 6, R) 0 0 (qox, R) 0 (93, y, R) (. y, R) (92 y,...
determine if the language is regular, context-free, Turing-decidable, or undecidable. For languages that are regular, give...
determine if the language is regular, context-free, Turing-decidable, or undecidable. For languages that are regular, give a DFA that accepts the language, a regular expression that generates the language, and a maximal list of strings that arc pairwise distinguishable with respect to the language. For languages that are context-free but not regular, prove that the language is not regular and either give a context- free grammar that generates the language or a pushdown automaton that accepts the language. You need...
please answer a,b, and c Consider the following Turing Machine. M = “On input hA,Bi where...
please answer a,b, and c Consider the following Turing Machine. M = “On input hA,Bi where A and B are DFAs: 1. Iterate through strings in Σ∗ in shortlex order; where Σ represents the common symbols of their input alphabets. For each string iterated, simulate both A and B on it. 2. If a string is ever encountered that both A and B accept, then accept.” (a) (2 points) Give a description, in English, of the language that M recognizes....
Consider the following Turing Machine: Show the execution traces using each of the following input strings:...
Consider the following Turing Machine: Show the execution traces using each of the following input strings: (a) aaa (b) aba (c) ababb (d) What does the machine do?
1. (25 points) Turing Machine Design: Design a Turing machine Mi that operates on inputs that...
1. (25 points) Turing Machine Design: Design a Turing machine Mi that operates on inputs that are strings in 10, 1). Design Mi so that it recognizes the following language: fw E (0.1)l w ends in 10 or 111) a. Provide a high-level English prose description for the actions of Mi b. Provide an implementation-level description of M. c. List the parts of the formal 7-tuple for M d. Draw a detailed pictorial state diagram for M1 e. List the...
Give an informal description of a deterministic Turing machine for the language L = {w ∈...
Give an informal description of a deterministic Turing machine for the language L = {w ∈ {0, 1}* | w is not of the form (01)^n (10)^n for n ≥ 0}.
Give the state diagram for a single-tape Turing machine for the following language. L = {a#b#c...
Give the state diagram for a single-tape Turing machine for the following language. L = {a#b#c | a, b, c ∈ { 0 , 1 }∗ and a,b,c all have the same number of zeroes} Assume Σ = { 0 , 1 }
Give the state diagram of a Turing machine that accepts the following language over S =...
Give the state diagram of a Turing machine that accepts the following language over S = {0,1}: {0m1n: m > n ≥ 0}
(a) Give a high level description of a single-tape deterministic Turing machine that decides the language...
(a) Give a high level description of a single-tape deterministic Turing machine that decides the language L = {w#x#y | w ∈ {0, 1} ∗ , x ∈ {0, 1} ∗ , y ∈ {0, 1} ∗ , and |w| > |x| > |y|}, where the input alphabet is Σ = {0, 1}. (b) What is the running time (order notation) of your Turing machine? Justify your answer.
Give the implementation-level description of a Turing machine that decides the following language over the alphabet...
Give the implementation-level description of a Turing machine that decides the following language over the alphabet a, b, c^. You are encouraged but not required to use a multi- tape and/or nondeterministic Turing Machine. Lan n s a positive integer )
What is the language of accepted strings by the below Turing
machine?
{a*b*}
{ambn | m, n ≥ 0}
{ambm | m ≥ 0}
{ambnam | m,
n ≥ 0}
This Turing machine is non-deterministic, so it cannot accept a
deterministic language.
( R) go 9 q 93 (9,X, R) (91a, R) (qa, a, L) (hra, R) (h. b, R) (92. y, L) Ø (h. 6, R) 0 0 (qox, R) 0 (93, y, R) (. y, R) (92 y,...
determine if the language is regular, context-free, Turing-decidable, or undecidable. For languages that are regular, give a DFA that accepts the language, a regular expression that generates the language, and a maximal list of strings that arc pairwise distinguishable with respect to the language. For languages that are context-free but not regular, prove that the language is not regular and either give a context- free grammar that generates the language or a pushdown automaton that accepts the language. You need...
Consider the following Turing Machine: Show the execution traces using each of the following input strings: (a) aaa (b) aba (c) ababb (d) What does the machine do?
1. (25 points) Turing Machine Design: Design a Turing machine Mi that operates on inputs that are strings in 10, 1). Design Mi so that it recognizes the following language: fw E (0.1)l w ends in 10 or 111) a. Provide a high-level English prose description for the actions of Mi b. Provide an implementation-level description of M. c. List the parts of the formal 7-tuple for M d. Draw a detailed pictorial state diagram for M1 e. List the...
Give the implementation-level description of a Turing machine that decides the following language over the alphabet a, b, c^. You are encouraged but not required to use a multi- tape and/or nondeterministic Turing Machine. Lan n s a positive integer )
Most questions answered within 3 hours.
-
Write a psudocode:
1. Define a function called authorize that takes in 2 strings,
uName, and...
asked 1 minute from now -
What mass of ethylene glycol (C2H6O2) must be added to 211.0 g
of water to obtain...
asked 8 seconds ago -
Mary's employer has a defined benefits retirement plan, which
pay 3.2% of her last year's salary...
asked 3 minutes ago -
What are the characteristics and behavior of an ethical
manager?
Explain, in your words, what ethics...
asked 20 minutes ago -
1. Which of the following is NOT an argument that McMahan uses
to show that jus...
asked 41 minutes ago -
A crate slides up a frictionless slope. At the end of 3 seconds
its velocity is...
asked 58 minutes ago -
Use the following information to answer the next seven
questions.
Suppose there are three potential states...
asked 54 minutes ago -
If we only have interstitial and substitutional diffusion, then
what do we consider the process of...
asked 1 hour ago -
You look at yourself in a shiny 9.6-cm-diameter Christmas tree
ball.
If your face is 21.0...
asked 1 hour ago -
If we were to measure the relaxation time of a muscle after
undergoing tetanus compared to...
asked 1 hour ago -
4CO(g) + 8H2(g) -----> 3CH4(g) +
CO2(g) + 2H2O(l)
Use the following data as needed to...
asked 1 hour ago -
without using map
1. Write a C++ program to find out the top 10 words in...
asked 1 hour ago