Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Computational complexity theoryDSPACETheoretical computer science

Broader (1)

Turing machine

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Design of a supervisory controller for Cooperative Intersection Control using Model Predictive Control
2013
2013
Spatial processing techniques for satellite altimetry applications in continental hydrology
Radar-based satellite altimetry is a well recognized measuring technique with good precision for oceanographic applications. For… 
2010
2010
Static and dynamic test of high resolution DAC based on over sampling and low resolution ADC
2009
2009
Nondeterministic One-Tape Off-Line Turing Machines and Their Time Complexity
In this paper we consider the time and the crossing sequence complexities of one-tape off-line Turing machines. We show that the… 
2005
2005
Chord Diagrams and Gauss Codes for Graphs
Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have… 
1995
1995
Optimal Lower Bounds on the Multiparty Communication Complexity
In this paper, we derive optimal lower and upper bounds on the multiparty communication complexity of boolean functions. We… 
1992
1992
Determinism vs. Nondeterminism in Multiparty Communication Complexity
A given Boolean function has its input distributed among many parties. The aim is to determine which parties to talk to and what… 
1987
1987
Two lower bounds in asynchronous distributed computation
  • P. DurisZ. Galil
  • 28th Annual Symposium on Foundations of Computer…
  • 1987
  • Corpus ID: 12927628
1981
1981
Fooling a two-way automaton or one pushdown store is better than one counter for two way machines (Preliminary Version)
We define a language L and show that is cannot be recognized by any two way deterministic counter machine. It is done by fooling… 
1981
1981
A Space Bound for One-Tape Multidimensional Turing Machines
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)