Previous |  Up |  Next

Article

Title: Crossing-bounded computations and their relation to the LBA-problem (English)
Author: Chytil, Michal P.
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 12
Issue: 2
Year: 1976
Pages: (76)-85
.
Category: math
.
MSC: 02F10
MSC: 03D10
MSC: 68A25
MSC: 68Q25
MSC: 68Q45
idZBL: Zbl 0324.68050
idMR: MR0408314
.
Date available: 2009-09-24T16:50:03Z
Last updated: 2012-06-05
Stable URL: http://hdl.handle.net/10338.dmlcz/124638
.
Reference: [1] J. E. Hopcroft J. D. Ullman: Formal languages and their relation to automata.Addison-Wesley, 1969. MR 0237243
Reference: [2] M. S. Paterson: Tape bounds for time-bounded Turing machines.JCSS 6, (1972), 116-124. Zbl 0236.02031, MR 0305667
Reference: [3] M. P. Chytil: Crossing-bounded automata and their relation to the LBA-problem.In Tagung liber Automatentheorie und Formale Sprachen, 1974, Universitat Dortmund.
Reference: [4] R. V. Freivalds: .oral communication. Zbl 1163.68022
Reference: [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.
.

Files

Files Size Format View
Kybernetika_12-1976-2_2.pdf 477.6Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo