Andris Ambainis, Rusins Freivalds, Marek Karpinski  Home/Search
Context
Related
| berkeley.edu/~ambaini...random_fa.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/~ambainis/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Languages weakly recognized by a Monte Carlo 2-way nite automaton with n states are proved to be strongly recognized by a Monte Carlo 2-way nite automaton with n O(n) states. This improves dramatically over the previously known result by M.Karpinski and R.Verbeek [10] which is also nontrivial since these languages can be nonregular [5]. For tally languages the increase in the number of states is proved to be only polynomial, and these languages are regular. 1 Introduction In most... (Update)
Active bibliography (related documents): More All
0.9: A Survey of Quantum Computing and Automata - de Doncker, Cucos (Correct)
0.8: Bounded Error Probabilistic Finite State Automata - Condon (Correct)
0.5: Single-Letter Languages Accepted By Alternating and.. - Geidmanis, Kaneps.. (Correct)
Similar documents based on text: More All
0.8: Size of Finite Probabilistic and Quantum Automata - Bonner, Freivalds, Rasscevskis (2002) (Correct)
0.5: Quantum Finite Multitape Automata - Ambainis, Bonner, Freivalds.. (1999) (Correct)
0.4: Inductive Inference with Procrastination: Back to Definitions - Ambainis, Freivalds, Smith (1999) (Correct)
BibTeX entry: (Update)
@inproceedings{ ambainis97weak,
author = "Ambainis and Freivalds and Karpinski",
title = "Weak and Strong Recognition by 2-way Randomized Automata",
booktitle = "{RANDOM}: International Workshop on Randomization and Approximation Techniques in Computer Science",
publisher = "LNCS",
year = "1997",
url = "citeseer.ist.psu.edu/304277.html" }
Citations (may not include all citations):276 Finite Markov Chains (context) - Kemeny, Snell - 1960
259 Elements of the Theory of Computation (context) - Lewis, Papadimitriou - 1981
121 Denumerable Markov Chains (context) - Kemeny, Snell et al. - 1976
23 The reduction of two-way automata to one-way automata (context) - Shepherdson - 1959
23 Probabilistic two-way machines (context) - Freivalds - 1981
14 Turing Machines with Sublogarithmic Space (context) - Szepietowski - 1994
8 Lower space bounds for randomized computation - Freivalds, Karpinski - 1994
7 the Monte Carlo Space Constructible Functions and Separation.. (context) - Karpinski, Verbeek - 1987
7 Lecture Notes in Computer Science (context) - Freivalds, algorithms - 1979
6 The complexity of probabilistic versus deterministic nite au.. - Ambainis - 1996
6 Probabilistic machines can use less running time (context) - Freivalds - 1977
3 A lower bound for probabilistic algorithms for nite state ma.. (context) - Greenberg, Weiss - 1986
2 Regularity of one-letter languages acceptable by 2-way nite .. (context) - Ka - 1991
2 Summer Institute of Symbolic Logic (context) - Rabin, automata - 1957
2 Finite state veriers I: The power of interaction (context) - Dwork, Stockmeyer - 1992
2 Projections of languages recognizable by probabilistic and a.. (context) - Freivalds - 1981
1 Alternating multihead nite automata (context) - King - 1981
Documents on the same site (http://www.cs.berkeley.edu/~ambainis/papers.html): More
Delayed Binary Search, or Playing Twenty Questions with .. - Ambainis, Bloch.. (1999) (Correct)
How Rich Is The Structure of Intrinsic Complexity of Learning? - Ambainis (Correct)
The Complexity of Probabilistic versus Deterministic Finite.. - Ambainis (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC