Results 211 to 220 of about 134,383 (239)
Some of the next articles are maybe not open access.
2017
A model of computation, the so-called inductive Turing machine, is introduced. In this model, a process of ''computation'' is not required to halt for giving the result. The ''computation capacity'' of inductive T- machines is shown to be strictly stronger than that of usual Turing machines.
openaire +2 more sources
A model of computation, the so-called inductive Turing machine, is introduced. In this model, a process of ''computation'' is not required to halt for giving the result. The ''computation capacity'' of inductive T- machines is shown to be strictly stronger than that of usual Turing machines.
openaire +2 more sources
1991
Abstract "In introducing the idea of a pushdown automaton in Chapter 5 we found it helpful to think of a word w = a1a2 an in A as printed on a tape with the initial state i scanning the leftmost square. An FSA can be seen as acting on w by constantly moving right, deleting a symbol at each stage.
openaire +1 more source
Abstract "In introducing the idea of a pushdown automaton in Chapter 5 we found it helpful to think of a word w = a1a2 an in A as printed on a tape with the initial state i scanning the leftmost square. An FSA can be seen as acting on w by constantly moving right, deleting a symbol at each stage.
openaire +1 more source