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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The Cooperative Intersection Control (CIC) aims to automate a road intersection to achieve an efficient, safe and smooth flow of… 
2013
2013
Radar-based satellite altimetry is a well recognized measuring technique with good precision for oceanographic applications. For… 
2012
2012
For a given graph, G, the crossing number crk(G) denotes the minimum number of edge crossings when a graph is drawn on an… 
2011
2011
Developing the concept of crossing sequences for multitape computations proposed in 1979 by G. Wechsung, we derive new relations… 
2007
2007
A new method is presented for the static characterization of high resolution digital to analog converters (DAC). The method is… 
2005
2005
Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have… 
2004
2004
A method for measuring both the carrier frequency and the carrier phase offset in the case of single carrier digital modulation… 
1981
1981
We define a language L and show that is cannot be recognized by any two way deterministic counter machine. It is done by fooling…