Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

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
Cooperative Intersection Control Based on Virtual Platooning
This paper proposes a cooperative intersection control strategy, which aims to decrease the number of accidents and to increase… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 3
  • figure 4
Is this relevant?
2018
2018
Design of a supervisory controller for Cooperative Intersection Control using Model Predictive Control
Abstract The Cooperative Intersection Control (CIC) methodology ensures a safe, smooth traffic flow through an automated… Expand
Is this relevant?
2010
2010
Static and dynamic test of high resolution DAC based on over sampling and low resolution ADC
Abstract The problem of the signal acquisition with high resolution and linearity for static and dynamic characterization of high… Expand
Is this relevant?
2006
2006
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… Expand
Is this relevant?
2002
2002
On the decidability of self-assembly of infinite ribbons
Self-assembly, the process by which objects autonomously come together to form complex structures, is omnipresent in the physical… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
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… Expand
Is this relevant?
1989
1989
Concatenation of Inputs in a Two-Way Automaton
Abstract To every input string of a two-way automaton one associates a quadruple of partial functions (or relations) between the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1989
Highly Cited
1989
A Note on the Reduction of Two-Way Automata to One-Way Automata
  • M. Vardi
  • Inf. Process. Lett.
  • 1989
    • Corpus ID: 14873603
We describe a new elementary reduction of two-way automata to one-way automata. The reduction is based on the subset construction… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
On notions of information transfer in VLSI circuits
Several papers have recently dealt with techniques for proving area-time lower bounds for VLSI computation by “crossing sequence… Expand
  • figure 2
  • figure 1
  • figure 4
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
In this paper we describe a new method for proving lower bounds on the complexity of VLSI - computations and more generally… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE