Chytil, Michal P. Crossing-bounded computations and their relation to the LBA-problem. (English) Zbl 0324.68050 Kybernetika, Praha 12, 76-85 (1976). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page MSC: 68Q45 Formal languages and automata 68Q25 Analysis of algorithms and problem complexity 03D10 Turing machines and related notions × Cite Format Result Cite Review PDF Full Text: EuDML References: [1] J. E. Hopcroft J. D. Ullman: Formal languages and their relation to automata. Addison-Wesley, 1969. · Zbl 0196.01701 [2] M. S. Paterson: Tape bounds for time-bounded Turing machines. JCSS 6, (1972), 116-124. · Zbl 0236.02031 · doi:10.1016/S0022-0000(72)80017-5 [3] M. P. Chytil: Crossing-bounded automata and their relation to the LBA-problem. In Tagung liber Automatentheorie und Formale Sprachen, 1974, Universitat Dortmund. [4] R. V. Freivalds: oral communication. · Zbl 1163.68022 · doi:10.1016/j.tcs.2009.01.028 [5] J. Hartmanis H. B. Hunt III: The LBA Problem and its Importance in the Theory of Computing. TR 73-171, May 1973, Cornell University. · Zbl 0352.68100 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.