See this document in CiteSeerX!

Size of Finite Probabilistic and Quantum Automata (2002)  (Make Corrections)  
Richard Bonner, Rusins Freivalds, Zigmars Rasscevskis



  Home/Search   Context   Related

 
View or download:
ima.mdh.se/personal/rbr/course...02.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ima.mdh.se/personal/...riga02proc (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Rabin[Rab63] proved that if arbitrary language is accepted by some probabilistic automaton with an isolated cutpoint then there exists some deterministic automaton that accepts this language. He showed that for any probabilistic automaton with n states, r accepting states and radius of isolation J the equivalent deterministic automaton has at most (1 + ) states. However it appeared to be a problem to construct a concrete language for which deterministic automaton would really have to have such... (Update)

Active bibliography (related documents):   More   All
0.5:   Quantum Automata With Mixed States; Functions and.. - Dubrovsky, Soegulnaja (2002)   (Correct)
0.5:   Characterizations of 1-Way Quantum Finite Automata - Brodsky, Pippenger   (Correct)
0.5:   Dense Quantum Coding and a Lower Bound for 1-way.. - Ambainis, Nayak.. (1999)   (Correct)

Similar documents based on text:   More   All
1.5:   The Complexity of Probabilistic versus Deterministic Finite.. - Ambainis (1996)   (Correct)
0.9:   Genetic Programming Application to One-way Quantum Finite State.. - Luchko   (Correct)
0.8:   Weak and Strong Recognition by 2-way Randomized Automata - Ambainis, Freivalds..   (Correct)

BibTeX entry:   (Update)

@misc{ bonner-size,
  author = "Richard Bonner and Rusins Freivalds and Zigmars Rasscevskis",
  title = "Size of Finite Probabilistic and Quantum Automata",
  url = "citeseer.ist.psu.edu/bonner02size.html" }
Citations (may not include all citations):
52   Information and Control (context) - Rabin - 1963
42   Finite Automata: Behavior and Synthesis (context) - Trakhtenbrot, Brzdi - 1973
21   the power of quantum finite state automata - Kondacs, Watrous - 1997
13   way quantum finite automata: strengths (context) - Ambainis, Freivalds - 1998
8   Theoretical Computer Science (context) - Moore, Crutchfield et al. - 2000
6   The complexity of probabilistic versus deterministic finite .. - Ambainis - 1996  ACM   DBLP
5   the growth of the number of states in result of determinizat.. (context) - Freivalds - 1982
4   the languages accepted by finite reversible automata (context) - Pin - 1987
2   Exact Results for Accepting Probabilities of Quantum Automat.. - Ambainis, Iikusts - 2001  ACM   DBLP

Documents on the same site (http://www.ima.mdh.se/personal/rbr/courses/riga02proc.html):   More
Capabilities of Finite Standardization - Tervits   (Correct)
Boolean Function Computation by Probabilistic and Quantum.. - Kravcevs   (Correct)
The Complexity of Probabilistic VS Quantum Finite Automata - Midrijanis   (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