See this document in CiteSeerX!

Genetic Programming Application to One-way Quantum Finite State Automata Generation  (Make Corrections)  
Alexey Luchko



  Home/Search   Context   Related

 
View or download:
ima.mdh.se/personal/rbr/course...11.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: In this paper I would like to introduce genetic programming application to one-way quantum finite state automata (QFA) generation. (Update)

Active bibliography (related documents):   More   All
0.7:   Quantum Learning by Finite Automata - Bonner, Freivalds   (Correct)
0.3:   Learning From Zero Information - Greiziqa, Grundmane (2002)   (Correct)
0.3:   Capabilities of Finite Standardization - Tervits   (Correct)

Similar documents based on text:   More   All
0.9:   Size of Finite Probabilistic and Quantum Automata - Bonner, Freivalds, Rasscevskis (2002)   (Correct)
0.9:   The Complexity of Probabilistic VS Quantum Finite Automata - Midrijanis   (Correct)
0.8:   Characterizations of 1-Way Quantum Finite Automata - Brodsky, Pippenger   (Correct)

BibTeX entry:   (Update)

@misc{ luchko-genetic,
  author = "Alexey Luchko",
  title = "Genetic Programming Application to One-way Quantum Finite State Automata
    Generation",
  url = "citeseer.ist.psu.edu/523944.html" }
Citations (may not include all citations):
21   the power of quantum finite state automata - Kondacs, Watrous - 1997
19   Quantum Computing (context) - Gruska - 1999
13   way quantum finite automata: strengths (context) - Ambainis, Freivalds - 1998
4   Lecture Notes in Computer Science (context) - Freivalds, Winter et al. - 2001
3   Towards axiomatic basis of inductive inference (context) - Brzdi, Freivalds et al. - 2001
1   the robot going around the wall (context) - Krutjko, application et al. - 2002

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