✦ LIBER ✦

A simplified proof of the real-time recognizability of palindromes on turing machines

✍ Scribed by A. O. Slisenko

Publisher: Springer US
Year: 1981
Tongue: English
Weight: 732 KB
Volume: 15
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf01404109

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the structure of one-tape nondetermin

On the structure of one-tape nondeterministic turing machine time hierarchy

✍ Kojiro Kobayashi 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 983 KB

Certain estimates of the time of computa

Certain estimates of the time of computations on turing machines with an input

✍ M. K. Valiev 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 598 KB

Simplified strategy of the dynamic model

Simplified strategy of the dynamic model of a 6-UPS parallel kinematic machine for real-time control

✍ Jinsong Wang; Jun Wu; Liping Wang; Tiemin Li 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Online real-time preemptive scheduling o

Online real-time preemptive scheduling of jobs with deadlines on multiple machines

✍ Bhaskar Das Gupta; Michael A. Palis 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 139 KB

In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized in terms of their minimum stretch factor (or, equivalently, their maximum execution rate r = 1= ). We consider two well-

A simplified proof of a theorem of J. Bo

A simplified proof of a theorem of J. Bourgain on the extension of operators

✍ S. V. Kislyakov 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 214 KB

A new proof of Beurling's theorem on the

A new proof of Beurling's theorem on the spectrum of bounded functions on the real axis

✍ Adriano M Garsia 📂 Article 📅 1963 🏛 Elsevier Science 🌐 English ⚖ 126 KB