Crossing sequence (Turing machines)

Known as: Crossing sequence 
In theoretical computer science, a crossing sequence at boundary i, denoted as or sometimes , is the sequence of states of a Turing machine on input… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1959-2017
01219592017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We stud the problem of optimally controlling autonomous vehicles to safely cross an intersection. The problem is approached by… (More)
  • figure 1
  • table I
  • figure 2
Is this relevant?
2014
2014
We prove that the maximum speed and the entropy of a one-tape Turing machine are computable, in the sense that we can approximate… (More)
  • figure 1
Is this relevant?
2009
2009
In this paper we consider the time and the crossing sequence complexities of onetape off-line Turing machines. We show that the… (More)
  • table 1
  • table 2
Is this relevant?
2007
2007
A new method is presented for the static characterization of high resolution digital to analog converters (DAC). The method is… (More)
  • figure 1
Is this relevant?
2002
2002
Self-assembly, the process by which objects autonomously come together to form complex structures, is omnipresent in the physical… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1998
1998
We derive a general technique for obtaining lower bounds on the multiparty communication complexity of boolean functions. We… (More)
Is this relevant?
1989
1989
We describe a new elementary reduction of two-way automata to one-way automata. The reduction is based on the subset construction… (More)
Is this relevant?
1987
1987
We introduce new techniques for deriving lower bounds on the message complexity in asynchronous distributed computation. These… (More)
Is this relevant?
1981
1981
Let L be a language recognized by a nondetexministic d-dimensional Turing machine with one worktape head of time complexity T(n… (More)
Is this relevant?
Highly Cited
1959
Highly Cited
1959
We describe a new elementary reduction of two-way automata to one-way automata. The reduction is based on the subset construction… (More)
Is this relevant?