A lower bound for probabilistic algorithms for finite state machines

Zero-knowledge with finite state verifiers (invited talk)

CRYPTO '88 Proceedings on Advances in cryptology

Finite state verifiers I: the power of interaction

Journal of the ACM (JACM)

Finite state verifiers II: zero knowledge

Journal of the ACM (JACM)

On the power of finite automata with both nondeterministic and probabilistic states (preliminary version)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Probabilistic rebound Turing machines

Theoretical Computer Science

Two-way finite automata with quantum and classical states

Theoretical Computer Science - Natural computing

On some variations of two-way probabilistic finite automata models

Theoretical Computer Science

Some Observations on Two-Way Finite Automata with Quantum and Classical States

ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues

Group Input Machine

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science

Closure properties of the classes of sets recognized by space-bounded two-dimensional probabilistic turing machines

Information Sciences: an International Journal

Computation with narrow CTCs

UC'11 Proceedings of the 10th international conference on Unconventional computation

On some variations of two-way probabilistic finite automata models

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory