turing-machines
Construct a Turing-Machine to decide ww^Rw
w^R is the reverse of w and w is {0, 1}* . So the TM needs to decide a word followed by the reverse of this word followed by the word.[详细]
2023-04-10 08:52 分类：问答Real world uses of DFA,NFA,PDA and Turing machines
I am now taking a course on Theory of Computation. I can und开发者_开发技巧erstand the concepts well. I can able to solve the problems. And, when I asked my instructor about the real world application[详细]
2023-04-06 03:28 分类：问答How are algorithms and data structures related to Turing Machines?
My copy of The Design and Analysis of Computer Algorithms has arrived today.In the first chapter, the author introduced Turing Machines. I have two other algorithms textbooks, Introduction to Algori开[详细]
2023-03-29 06:49 分类：问答Brainfuck interpreter using cellular automata
Does anyone have a set of cellular automat开发者_如何学编程a rules for a brainfuck interpreter?I assume it would it be similar to implementations of a universal turing machine.Those exist on wolfram s[详细]
2023-03-29 03:26 分类：问答Nondeterministic Algorithms [closed]
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical andcannot be开发者_如何学编程 reasonably answered in its current for[详细]
2023-03-28 19:14 分类：问答Prove that this language is undecidable
Is the following language L undecidable? L = {M | M is a Turing machine description and there exists an input x of length k such that M halts after at most k steps}[详细]
2023-03-19 09:04 分类：问答Is the Starbucks menu Turing Complete?
If we were to interpret the Starbuck\'s mini-language menu system as some sort of grammar or state machine, woul开发者_运维百科d that grammar be Turing complete? A description of the Starbuck\'s order[详细]
2023-03-14 04:54 分类：问答Is a CFG using a nil language decidable?
If I have a Context-Free Grammar G such that the language of G is nil, is G decidable? I know the answer is yes, but I am having trouble proving this. My first thought is to say there is only one sta[详细]
2023-02-18 02:45 分类：问答Turing Machine with non trivial states and transitions
Please give me some idea as to how to go about this Draw a Turing machine (using 开发者_JAVA百科Sipser notation) having at least 4 nontrivial (i.e., nonrejecting) states and at least six nontrivial ([详细]
2023-02-13 01:53 分类：问答What is meant by "dovetailing"?
While reading the reviews for Stephen Wolfram\'s \"A New Kind of Science\" on Amazon, I came across the following statement:[详细]
2023-02-13 00:30 分类：问答
![Interactive visualization of a graph in python [closed]](https://www.devze.com/res/2023/04-10/09/92d32fe8c0d22fb96bd6f6e8b7d1f457.gif)
加载中,请稍侯......