Janis Kaneps

Tally Languages Accepted by Alternating Multitape Finite Automata

Elena Calude, Dainis Geidmanis, Kalvis Apsitis, 1997, COCOON.

Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata

Janis Kaneps, 1991, FCT.

Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines

Rusins Freivalds, Janis Kaneps, 1990, MFCS.

Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata

Rusins Freivalds, Janis Kaneps, R. Freivalds, 1991, ICALP.

Tally Languages Accepted by Monte Carlo Pushdown Automata

Rusins Freivalds, Dainis Geidmanis, Janis Kaneps, 1997, RANDOM.