| 1997 |
|---|
| 5 | | Dainis Geidmanis,
Janis Kaneps,
Kalvis Apsitis,
Daina Taimina,
Elena Calude:
Tally Languages Accepted by Alternating Multitape Finite Automata.
COCOON 1997: 422-430 |
| 4 | | Janis Kaneps,
Dainis Geidmanis,
Rusins Freivalds:
Tally Languages Accepted by Monte Carlo Pushdown Automata.
RANDOM 1997: 187-195 |
| 1991 |
|---|
| 3 | | Janis Kaneps:
Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata.
FCT 1991: 287-296 |
| 2 | | Janis Kaneps,
Rusins Freivalds:
Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata.
ICALP 1991: 174-185 |
| 1990 |
|---|
| 1 | | Janis Kaneps,
Rusins Freivalds:
Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines.
MFCS 1990: 355-361 |
