Janis Kaneps

According to our database, Janis Kaneps authored at least 5 papers between 1990 and 1997.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1997

Tally Languages Accepted by Monte Carlo Pushdown Automata.

Janis Kaneps, Dainis Geidmanis, Rusins Freivalds

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

Tally Languages Accepted by Alternating Multitape Finite Automata.

Dainis Geidmanis, Janis Kaneps, Kalvis Apsitis, Daina Taimina, Elena Calude

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1991

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

Janis Kaneps, Rusins Freivalds

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

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

Janis Kaneps

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990

Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines.

Janis Kaneps, Rusins Freivalds

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990