✦ LIBER ✦

HDTOL matching of computations of multitape automata

✍ Scribed by Karel Culik; Juhani Karhumäki

Publisher: Springer-Verlag
Year: 1989
Tongue: English
Weight: 623 KB
Volume: 27
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00265153

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the theory of multitape automata

✍ B. G. Mirkin 📂 Article 📅 1968 🏛 Springer US 🌐 English ⚖ 491 KB

The equivalence problem of multitape fin

The equivalence problem of multitape finite automata

✍ T. Harju; J. Karhumäki 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 544 KB

Automata, matching and foraging behavior

Automata, matching and foraging behavior of bees

✍ F. Thuijsman; B. Peleg; M. Amitai; A. Shmida 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 489 KB

Using the approach of bounded rationality and myopic learning, we attempt to explain why bees (as examples of a forager animal) do the right (optimal) thing in an environment of many foragers, namely to adopt the Ideal Free Distribution, but do the wrong thing when they are alone, namely stick to th

Decidability of the equivalence problem

Decidability of the equivalence problem for A class of multitape multihead automata and flowcharts over memory

✍ S. K. Shukuryan 📂 Article 📅 1977 🏛 Springer US 🌐 English ⚖ 500 KB

Computation of shortest path in cellular

Computation of shortest path in cellular automata

✍ A.I. Adamatzky 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 859 KB

On the computational power of pushdown a

On the computational power of pushdown automata

✍ A.V. Aho; J.D. Ullman; J.E. Hopcroft 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 361 KB

We present a relation between the sets accepted by two-way pushdown automata and certain tape complexity classes of off-line Turing machines. Specifically, let L be a language accepted by a nondeterministic off-line Turing machine T. Let T have a t-symbol storage-tape alphabet. If for all but a fini