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)

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- Nikolce Murgovski, Gabriel Rodrigues de Campos, Jonas SjÃ¶berg
- 2015 54th IEEE Conference on Decision and Controlâ€¦
- 2015

We stud the problem of optimally controlling autonomous vehicles to safely cross an intersection. The problem is approached byâ€¦Â (More)

Is this relevant?

2014

2014

- Emmanuel Jeandel
- STACS
- 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)

Is this relevant?

2009

2009

- Giovanni Pighizzini
- ArXiv
- 2009

In this paper we consider the time and the crossing sequence complexities of onetape off-line Turing machines. We show that theâ€¦Â (More)

Is this relevant?

2007

2007

- D. L. Carni, Dora Maria Grimaldi
- 2007 IEEE Instrumentation & Measurementâ€¦
- 2007

A new method is presented for the static characterization of high resolution digital to analog converters (DAC). The method isâ€¦Â (More)

Is this relevant?

2002

2002

- Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus
- FOCS
- 2002

Self-assembly, the process by which objects autonomously come together to form complex structures, is omnipresent in the physicalâ€¦Â (More)

Is this relevant?

1998

1998

- Pavol Duris, JosÃ© D. P. Rolim
- J. Comput. Syst. Sci.
- 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

- Moshe Y. Vardi
- 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

- Pavol Duris, Zvi Galil
- 28th Annual Symposium on Foundations of Computerâ€¦
- 1987

We introduce new techniques for deriving lower bounds on the message complexity in asynchronous distributed computation. Theseâ€¦Â (More)

Is this relevant?

1981

1981

- Michael C. Loui
- Theor. Comput. Sci.
- 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

- John C. Shepherdson
- IBM Journal of Research and Development
- 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?