Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations

On quantum and probabilistic communication: Las Vegas and one-way protocols

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Communication complexity method for measuring nondeterminism in finite automata

Information and Computation

On the Power of Las Vegas II. Two-Way Finite Automata

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming

Measures of Nondeterminism in Finite Automata

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming

Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science

On the Power of Randomized Pushdown Automata

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory

3-Party message complexity is better than 2-party ones for proving lower bounds on the size of minimal nondeterministic finite automata

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures

Descriptional complexity of finite automata: concepts and open problems

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures

On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata

Journal of Computer and System Sciences

On the power of randomized multicounter machines

Theoretical Computer Science - Insightful theory

Converting Self-verifying Automata into Deterministic Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications

On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's

Theoretical Computer Science

Pushdown automata and multicounter machines, a comparison of computation modes

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

On the size of randomized OBDDs and read-once branching programs for k-stable functions

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Optimal simulation of self-verifying automata by deterministic automata

Information and Computation

Size complexity of rotating and sweeping automata

Journal of Computer and System Sciences

Pairs of complementary unary languages with “balanced” nondeterministic automata

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics

Two-Way automata making choices only at the endmarkers

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications