This paper describes the simulation of an S(n) space-bounded deterministic Turing machine by a reversible Turing machine operating in space S(n). It thus answers a question posed by Bennett in 1989… (More)

Uniformity notions more restrictive than the usual FO[<, +, *]-uniformity = FO[<, Bit]-uniformity are introduced. It is shown that the general framework exhibited by Barrington et al. still holds if… (More)

Several notions of deterministic linear languages are considered and compared with respect to their complexities and to the families of formal languages they generate. We exhibit close relationships… (More)

Givenm nite automata, the emptiness of intersection problem is to determine whether there exists a string which is accepted by allm automata. In the following we consider the case, when m is bounded… (More)

The Cayley Group Membership problem (CGM) is to input a groupoid (binary algebra) G given as a multiplication table, a subset X of G, and an element t of G, and to determine whether t can be… (More)

We characterize the languages in TC0 = L(Maj[<,Bit]) and L(Maj[<]) as inverse morphic images of certain groups. Necessarily these are infinite, since nonregular sets are concerned. To limit the power… (More)