Hostname: page-component-cb9f654ff-nr592 Total loading time: 0 Render date: 2025-08-27T13:42:34.433Z Has data issue: false hasContentIssue false
  • English
  • Français

Lower Bounds for Las Vegas Automataby Information Theory

Published online by Cambridge University Press:  15 November 2003

Mika Hirvensalo  and
Sebastian Seibert
Mika Hirvensalo
Affiliation:
TUCS-Turku Centre for Computer Science and Department of Mathematics, University of Turku, FIN-20014 Turku, Finland; . Supported by the academy of Finland under grant 44087.
Sebastian Seibert
Affiliation:
Lehrstuhl für Informatik I, RWTH Aachen, Ahornstraße 55, 52074 Aachen, Germany; .
Get access

Abstract

We show that the size of a Las Vegas automatonand the size of a complete, minimal deterministicautomaton accepting a regularlanguage are polynomially related. More precisely, we showthat if a regular language L is accepted by aLas Vegas automaton having r states such thatthe probability for a definite answer to occur is at least p,then r ≥ np , where n is the number of the statesof the minimal deterministic automaton accepting L.Earlier this result has been obtainedin [2] by using a reduction to one-way Las Vegas communicationprotocols, but here we give a direct proof based on information theory.

Keywords

Las Vegas automatainformation theory

Information

Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 37 , Issue 1 , January 2003 , pp. 39 - 49
Copyright
© EDP Sciences, 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

T.M. Cover and J.A. Thomas, Elements of Information Theory. John Wiley & Sons, Inc. (1991).
P. Duris, J. Hromkovic, J.D.P. Rolim and G. Schnitger, Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. Springer, Lecture Notes in Comput. Sci. 1200 (1997) 117-128. CrossRef
J. Hromkovic, personal communication.
H. Klauck, On quantum and probabilistic communication: Las Vegas and one-way protocols, in Proc. of the ACM Symposium on Theory of Computing (2000) 644-651.
C.H. Papadimitriou, Computational Complexity. Addison-Wesley (1994).
S. Yu, Regular Languages, edited by G. Rozenberg and A. Salomaa. Springer, Handb. Formal Languages I (1997).