2020欧洲杯时间表

Questions tagged [turing-machines]

2020欧洲杯时间表 A Turing machine is an idealized model of computation consisting of a finite-state control, an infinite tape holding information, and a read head positioned somewhere over the tape. Turing machines are used in computability theory to reason about the limits of computation, to provide a formal definition for an algorithm, and to provide formal models for nondeterminism.

Filter by
Sorted by
Tagged with
1
vote
1answer
12 views

Can a PDA with two stacks accept RE Language?

So, I was having a bit of difficulty figuring what exactly is meant by a String on which Turing Machine does not halt. I read somewhere that a Turing Machine is equivalent to a deterministic automata ...
0
votes
0answers
11 views

how do I give a detailed description of a turning machine

how do I give a detailed description (in words) of a Turing machine that accepts the following language: L = { a^(k)ba^(k) | k element N}
0
votes
0answers
34 views

Is regular TM recognizable?

What I learned from theorem 5.3, we are dividing the problem into to 1)Language of all strings 2)Not all strings. Where ATM is recognizable but in case when it accepts a word ,modified TM too have to ...
0
votes
1answer
47 views

Multiplicate two binary numbers in turing machine

I am trying to write the multiplication of two binary numbers using turing machine. I tried to copy the multiplier, and after each addition, subtract 1 from it (for example 110*110 = 110 + 110 // 110 -...
0
votes
1answer
37 views

PDA to Turing machine conversion

I have to convert a given PDA into Turing machine form, and am struggling to find any resources on how to do this. If someone could explain or point me to some resource that could explain how to do ...
-1
votes
2answers
62 views

Show that the class of decidable languages is closed under the operations of: Complementation, Concatenation, and Intersection

I understand that the problem is asking for a proof for the specified Turing machine. My issue derives from not being able to understand what type of structure this problem is proposing, as indicated ...
1
vote
0answers
14 views

What is the prefix of L={⟨M⟩ | M is TM that accepts every palindrome over its alphabet }?

I am trying to find the prefix of L={⟨M⟩ | M is TM that accepts every palindrome over its alphabet }, but I am not sure how to do it since it involves a Turing Machine in it. Does anyone have any ...
0
votes
0answers
19 views

Does there exists a language L such that L is decidable, Prefix(L) is also decidable?

If such a language exists, what kind of condition it has to meet?
0
votes
0answers
11 views

How do we take the advantage of “infinite language” to avoid repetitions of an enumerating algorithm?

In the defination of "Recursively enumerable language" from Wikipedia, it says: "A recursively enumerable language is a formal language for which there exists a Turing machine (or other computable ...
0
votes
1answer
37 views

Does there exist a regular language that's not Turing Recognizable?

Is it possible for a regular language to be non-Turing Recognizable?
0
votes
0answers
29 views

How to construct a turing machine for the following language?

Any ideas on how to construct a turing machine that recognize the following language? { a^2n b^(n^2-3) | n ≥ 3 }
0
votes
1answer
34 views

How Turing machines were built, from the hardware point of view, to read data? And erase?

My question is more on the engineering side; I would like to know how, physically, computation machines were built in the beginnings. How Turing machines could read and erase? They wrote on a paper ...
1
vote
1answer
17 views

Can I classify a grammar on the basis of comparison of length

Whenever we have regular language then we can have no comparison.(for the obvious reason that it has no memory) And when context free language we can have Max 1 comparison. For example a^n b^n here ...
1
vote
1answer
121 views

Proving A Language Is Undecidable Using Turing Reductions

I need to prove that the language L(EVEN) = { M : |L(M)| is even } is undecidable. In other words, the language L(EVEN) is the set of all Turing Machines which accept some language of even ...
0
votes
0answers
15 views

How to decide polynomial time reducibility of TM?

Consider the language L: L = {< M >⎪M is a Turing machine and L(M) ≤p {0^p 1^2p ⎪p > 0}} Where the symbol ‘≤p’ refers to polynomial time reducible which of the following is true regarding the ...

15 30 50 per page
1
2 3 4 5
29