Author:
Geffert Viliam,Popély Norbert
Subject
Computer Science Applications,General Mathematics,Software
Reference21 articles.
1. M. Alberts, Space complexity of alternating Turing machines, inProc. Fund. Comput. Theory. Springer-Verlag,Lecture Notes in Comput. Sci.199(1985) 1-7.
2. A language over a one symbol alphabet requiring only O (log log n) space
3. A. Bertoni, C. Mereghetti and G. Pighizzini, Strong optimal lower bounds for Turing machines that accept nonregular languages, inProc. Math. Found. Comput. Sci.Springer-Verlag,Lecture Notes in Comput. Sci.969(1995) 309-18.
4. A. Bertoni, C. Mereghetti and G. Pighizzini,Space and reversal complexity of nonregular languages. Technical Report, University of Milano (1998).
5. Alternation