Proof of a conjecture of R. Kannan

Authors:
J.-C. Birget
Affiliations:
Computer Science and Engineering Department, University of Nebraska, Lincoln, NE
Venue:
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Year:
1989

Citing 5
Cited 0

Concatention of inputs in a two-way automation

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Nondeterminism and the size of two way finite automata

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Lower bounds on the size of sweeping automata

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Alternation and the power of nondeterminism

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

R. Kannan conjectured that every non-deterministic two-way finite automaton can be positionally simulated by a deterministic two-way finite automaton. The conjecture is proved here by reduction to a similar problem about finite semigroups. The method and the result are then generalized to alternating two-way finite automata.