Ibarra, Oscar H.; Tran, Nicholas Q. Weak synchronization and synchronizability of multi-tape pushdown automata and Turing machines. (English) Zbl 1355.68089 J. Autom. Lang. Comb. 19, No. 1-4, 119-132 (2014). MSC: 68Q05 PDF BibTeX XML Cite \textit{O. H. Ibarra} and \textit{N. Q. Tran}, J. Autom. Lang. Comb. 19, No. 1--4, 119--132 (2014; Zbl 1355.68089) Full Text: DOI
Knapik, Teodor; Payet, Étienne Synchronized product of linear bounded machines. (English) Zbl 0947.03057 Ciobanu, Gabriel (ed.) et al., Fundamentals of computation theory. 12th international symposium, FCT ’99. Iaşi, Romania, August 30 - September 3, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1684, 362-373 (1999). Reviewer: Anatoly V.Anisimov (Kyïv) MSC: 03D10 68Q85 03B25 PDF BibTeX XML Cite \textit{T. Knapik} and \textit{É. Payet}, Lect. Notes Comput. Sci. 1684, 362--373 (1999; Zbl 0947.03057)
Liśkiewicz, Maciej; Loryś, Krzysztof Fast simulations of time-bounded one-tape turing machines by space- bounded ones. (English) Zbl 0698.68057 SIAM J. Comput. 19, No. 3, 511-521 (1990). MSC: 68Q05 68Q25 03D15 03D10 PDF BibTeX XML Cite \textit{M. Liśkiewicz} and \textit{K. Loryś}, SIAM J. Comput. 19, No. 3, 511--521 (1990; Zbl 0698.68057) Full Text: DOI
Szepietowski, Andrzej On three-way two-dimensional Turing machines. (English) Zbl 0666.68050 Inf. Sci. 47, No. 2, 135-147 (1989). MSC: 68Q05 03D10 PDF BibTeX XML Cite \textit{A. Szepietowski}, Inf. Sci. 47, No. 2, 135--147 (1989; Zbl 0666.68050) Full Text: DOI
Szelepcsényi, Róbert The method of forcing for nondeterministic automata. (English) Zbl 0664.68082 Bull. EATCS 33, 96-100 (1987). Reviewer: D.Lucanu MSC: 68Q45 68Q05 PDF BibTeX XML Cite \textit{R. Szelepcsényi}, Bull. EATCS 33, 96--100 (1987; Zbl 0664.68082)
Jung, Hermann On probabilistic tape complexity and fast circuits for matrix inversion problems. (English) Zbl 0583.68024 Automata, languages and programming, 11th Colloq., Antwerp/Belg. 1984, Lect. Notes Comput. Sci. 172, 281-291 (1984). MSC: 68Q25 65F99 68Q05 94C10 65F10 PDF BibTeX XML
Dúriś, Pavol; Galil, Zvi Two tapes are better than one for nondeterministic machines. (English) Zbl 0558.68045 SIAM J. Comput. 13, 219-227 (1984). Reviewer: G.Mauri MSC: 68Q05 PDF BibTeX XML Cite \textit{P. Dúriś} and \textit{Z. Galil}, SIAM J. Comput. 13, 219--227 (1984; Zbl 0558.68045) Full Text: DOI
Inoue, Katsushi; Takanami, Itsuo; Taniguchi, Hiroshi A relationship between two-dimensional finite automata and three-way tape-bounded two-dimensional Turing machines. (English) Zbl 0525.68035 Theor. Comput. Sci. 24, 331-336 (1983). MSC: 68Q45 68Q05 PDF BibTeX XML Cite \textit{K. Inoue} et al., Theor. Comput. Sci. 24, 331--336 (1983; Zbl 0525.68035) Full Text: DOI
Frejvald, R. V. The possibilities of different models for one-sided probabilistic automata. (English) Zbl 0498.68035 Sov. Math. 25, No. 5, 21-32 (1981). MSC: 68Q45 68Q05 PDF BibTeX XML Cite \textit{R. V. Frejvald}, Sov. Math. 25, No. 5, 21--32 (1981; Zbl 0498.68035)
Frejvald, R. V. Capabilities of various models of one-way probabilistic automata. (Russian) Zbl 0486.68044 Izv. Vyssh. Uchebn. Zaved., Mat. 1981, No. 5(228), 26-34 (1981). MSC: 68Q45 68Q05 PDF BibTeX XML Cite \textit{R. V. Frejvald}, Izv. Vyssh. Uchebn. Zaved., Mat. 1981, No. 5(228), 26--34 (1981; Zbl 0486.68044)
Dyer, Charles R.; Rosenfeld, Azriel Parallel image processing by memory-augmented cellular automata. (English) Zbl 0454.68111 IEEE Trans. Pattern Anal. Mach. Intell. 3, 29-42 (1981). MSC: 68T10 68Q80 68Q05 PDF BibTeX XML Cite \textit{C. R. Dyer} and \textit{A. Rosenfeld}, IEEE Trans. Pattern Anal. Mach. Intell. 3, 29--42 (1981; Zbl 0454.68111) Full Text: DOI
Gill, John; Hunt, James; Simon, Janos Deterministic simulation of tape-bounded probabilistic Turing machine transducers. (English) Zbl 0442.68034 Theor. Comput. Sci. 12, 333-338 (1980). MSC: 68Q25 68Q05 68Q45 PDF BibTeX XML Cite \textit{J. Gill} et al., Theor. Comput. Sci. 12, 333--338 (1980; Zbl 0442.68034) Full Text: DOI
Inoue, Katsushi; Takanami, Itsuo Closure properties of three-way and four-way tape-bounded two-dimensional Turing machines. (English) Zbl 0442.68036 Inf. Sci. 18, 247-265 (1979). MSC: 68Q05 68Q45 PDF BibTeX XML Cite \textit{K. Inoue} and \textit{I. Takanami}, Inf. Sci. 18, 247--265 (1979; Zbl 0442.68036) Full Text: DOI
Inoue, Katsushi; Takanami, Itsuo Three-way tape-bounded two-dimensional Turing machines. (English) Zbl 0442.68035 Inf. Sci. 17, 195-220 (1979). MSC: 68Q05 68Q45 PDF BibTeX XML Cite \textit{K. Inoue} and \textit{I. Takanami}, Inf. Sci. 17, 195--220 (1979; Zbl 0442.68035) Full Text: DOI
Hemmerling, Armin Concentration of multidimensional tape-bounded systems of Turing automata and cellular spaces. (English) Zbl 0417.68034 Fundamentals of computation theory ’79, Proc. Conf., Berlin/Wendisch- Rietz 1979, 167-174 (1979). MSC: 68Q80 68Q05 PDF BibTeX XML
Inoue, Katsushi; Takanami, Itsuo; Nakamura, Akira; Ae, Tadashi One-way simple multihead finite automata. (English) Zbl 0408.68050 Theor. Comput. Sci. 9, 311-328 (1979). MSC: 68Q45 68Q05 PDF BibTeX XML Cite \textit{K. Inoue} et al., Theor. Comput. Sci. 9, 311--328 (1979; Zbl 0408.68050) Full Text: DOI
von Braunmühl, Burchard; Verbeek, Rutger Finite-change automata. (English) Zbl 0404.68081 Lect. Notes Comput. Sci. 67, 91-100 (1979). MSC: 68Q45 68Q05 68Q25 PDF BibTeX XML
Hartmanis, Juris Relations between diagonalization, proof systems, and complexity gaps. (English) Zbl 0398.68013 Theor. Comput. Sci. 8, 239-253 (1979). MSC: 68Q25 03D60 68Q65 03D15 03D20 PDF BibTeX XML Cite \textit{J. Hartmanis}, Theor. Comput. Sci. 8, 239--253 (1979; Zbl 0398.68013) Full Text: DOI Link
Book, Ronald V. On languages accepted by space-bounded oracle machines. (English) Zbl 0389.68029 Acta Inf. 12, 177-185 (1979). MSC: 68Q45 PDF BibTeX XML Cite \textit{R. V. Book}, Acta Inf. 12, 177--185 (1979; Zbl 0389.68029) Full Text: DOI
Inoue, Katsushi; Takanami, Itsuo A note on closure properties of the classes of sets accepted by tape- bounded two-dimensional Turing machines. (English) Zbl 0436.68031 Inf. Sci. 15, 143-158 (1978). MSC: 68Q05 68Q45 PDF BibTeX XML Cite \textit{K. Inoue} and \textit{I. Takanami}, Inf. Sci. 15, 143--158 (1978; Zbl 0436.68031) Full Text: DOI
Revesz, Gy. A note on the relation of Turing machines to phrase structure grammars. (English) Zbl 0404.68080 Comput. Linguist. Comput. Lang. 11, 11-16 (1976). MSC: 68Q45 68Q05 PDF BibTeX XML Cite \textit{Gy. Revesz}, Comput. Linguist. Comput. Lang. 11, 11--16 (1976; Zbl 0404.68080)