About log-on languages : preliminary version
Rafael Cases Muñoz, Joaquim Gabarró · 1985
We deal with on-line log-space Turing Machines with markers in the work tapes. In this type of machines we prove the existence of a language L satisfying L ϵ NSPACE_s (log n) , L ϵ NSPACE_s (log n) and L ϵ NSPACE_s (log n) We give an explicit definition of L. The main theorem uses minimisation techniques of deterministic finite automata.