Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,324 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Computational complexity theory
DSPACE
Theoretical 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
Falco Creemers
,
A. I. Morales Medina
,
E. Lefeber
,
Nathan van de Wouw
2018
Corpus ID: 59536548
2017
2017
Cooperative intersection automation using virtual platoons
A. I. Medina
,
N. Wouw
,
H. Nijmeijer
2017
Corpus ID: 69290619
The Cooperative Intersection Control (CIC) aims to automate a road intersection to achieve an efficient, safe and smooth flow of…
Expand
2013
2013
Spatial processing techniques for satellite altimetry applications in continental hydrology
P. Maillard
,
S. Calmant
Remote Sensing
2013
Corpus ID: 129440927
Radar-based satellite altimetry is a well recognized measuring technique with good precision for oceanographic applications. For…
Expand
2012
2012
Highly Non-Convex Crossing Sequences
Andrew McConvey
2012
Corpus ID: 125571277
For a given graph, G, the crossing number crk(G) denotes the minimum number of edge crossings when a graph is drawn on an…
Expand
2012
2012
Generation of Efficient Unraveling Processes of Deformable Linear Objects from Imperfect State Information
H. Wakamatsu
,
E. Morinaga
2012
Corpus ID: 131768804
2011
2011
Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences
J. Wiedermann
Workshop on Descriptional Complexity of Formal…
2011
Corpus ID: 37064655
Developing the concept of crossing sequences for multitape computations proposed in 1979 by G. Wechsung, we derive new relations…
Expand
2007
2007
Static Characterization of High Resolution DAC Based on Over Sampling and Low Resolution ADC
D. Carní
,
D. Grimaldi
IEEE Instrumentation & Measurement Technology…
2007
Corpus ID: 12756222
A new method is presented for the static characterization of high resolution digital to analog converters (DAC). The method is…
Expand
2005
2005
Chord Diagrams and Gauss Codes for Graphs
Thomas Fleming
,
B. Mellor
2005
Corpus ID: 118998560
Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have…
Expand
2004
2004
Carrier frequency and phase offset measurement for single carrier digital modulations
D. Luca Carnì
,
D. Grimaldi
Proceedings of the 21st IEEE Instrumentation and…
2004
Corpus ID: 33017932
A method for measuring both the carrier frequency and the carrier phase offset in the case of single carrier digital modulation…
Expand
1981
1981
Fooling a two-way automaton or one pushdown store is better than one counter for two way machines (Preliminary Version)
P. Duris
,
Z. Galil
Symposium on the Theory of Computing
1981
Corpus ID: 949244
We define a language L and show that is cannot be recognized by any two way deterministic counter machine. It is done by fooling…
Expand
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)
ACCEPT & CONTINUE