charibeiro's library 35 articles Export Sort

Hide details

	Neural representation of probabilistic information. [My Copy] Neural Comput, Vol. 15, No. 8. (August 2003), pp. 1843-1864. by M. J. Barber, J. W. Clark, C. H. Anderson posted to ia by charibeiro on 2006-07-17 18:06:01 as along with 1 person and 1 group klouie Glimcher_Lab
	PAC-learnability of Probabilistic Deterministic Finite State Automata [My Copy] J. Mach. Learn. Res., Vol. 5 (2004), pp. 473-497. by Alexander Clark, Franck Thollard posted to ia by charibeiro on 2006-07-17 18:05:27 as along with 1 person and 1 group assnoodles NU-PRL
	Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms [My Copy] Pattern Recognition, Vol. 38, No. 9. (September 2005), pp. 1349-1371. by P. Dupont, F. Denis, Y. Esposito posted to ia by charibeiro on 2006-07-17 18:05:13 as along with 6 people and 1 group gabgas m_bertini livingthingdan rabio metrozz kvorg livingthing
	Query Automata [My Copy] (1999), pp. 205-214. by Frank Neven, Thomas Schwentick posted to ia by charibeiro on 2006-07-17 18:05:05 as along with 3 people kinaba wasi stagediver
	Weighted Automata in Text and Speech Processing [My Copy] (29 March 2005) by Mehryar Mohri, Fernando Pereira, Michael Riley posted to ia by charibeiro on 2006-07-17 18:04:45 as along with 3 people markusd jrw kvorg
	Regular Languages Accepted by Quantum Automata [My Copy] Information and Computation, Vol. 165, No. 2. (15 March 2001), pp. 174-182. by Alberto Bertoni, Marco Carpentieri posted to qfa by charibeiro on 2006-06-13 05:13:42 as
	Quantum automata and algebraic groups [My Copy] (2003) by H. Derksen, E. Jeandel, P. Koiran posted to qfa by charibeiro on 2006-06-13 04:48:16 as
	Dense quantum coding and quantum finite automata [My Copy] J. ACM, Vol. 49, No. 4. (July 2002), pp. 496-511. by Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh Vazirani posted to qfa by charibeiro on 2006-06-13 04:12:41 as
	Algebraic Results on Quantum Automata [My Copy] Theory of Computing Systems, Vol. 39, No. 1. (February 2006), pp. 165-188. by Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Therien posted to qfa by charibeiro on 2006-06-13 04:01:00 as
	The Complexity of Probabilistic versus Quantum Finite Automata [My Copy] (9 Sep 2003) by Gatis Midrijanis posted to qfa by charibeiro on 2006-03-01 21:16:33 as
	On the Lower Bounds for One-Way Quantum Automata [My Copy] In MFCS '00: Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (2000), pp. 132-140. by Farid M. Ablayev, Aida Gainutdinova posted to qfa by charibeiro on 2006-03-01 21:02:33 as
	Undecidability on quantum finite automata [My Copy] In STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of computing (1999), pp. 368-375. by Masami Amano, Kazuo Iwama posted to qfa by charibeiro on 2006-03-01 20:46:52 as
	Automata with Quantum and Classical Resources [My Copy] IPSJ Digital Courier, Vol. 1, No. 0. (2005), pp. 442-449. by Masaki Nakanishi posted to qfa by charibeiro on 2006-02-16 18:47:12 as
	Quantum versus Classical Pushdown Automata in Exact Computation [My Copy] IPSJ Journal, Vol. 46, No. 10. (2005), pp. 2471-2480. by Yumiko Murakami, Masaki Nakanishi, Shigeru Yamashita, Katsumasa Watanabe posted to qfa by charibeiro on 2006-02-16 18:43:21 as
	Quantum versus deterministic counter automata [My Copy] Theor. Comput. Sci., Vol. 334, No. 1-3. (2005), pp. 275-297. by Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai posted to qfa by charibeiro on 2006-02-16 14:23:41 as
	One-Way Probabilistic Reversible and Quantum One-Counter Automata [My Copy] Lecture Notes in Computer Science, Vol. 1858 (2000), pp. 436-??. by Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai posted to qfa by charibeiro on 2006-02-16 14:21:06 as
	Optimal lower bounds for quantum automata and random access codes [My Copy] (7 Sep 1999) by Ashwin Nayak posted to qfa by charibeiro on 2006-02-15 16:55:51 as
	Quantum Pushdown Automata [My Copy] (9 Feb 2001) by Marats Golovkins posted to qfa by charibeiro on 2006-02-15 15:52:32 as
	Quantum Automata With Mixed States; Functions and Languages Recognition [My Copy] by Andrej Dubrovsky, Oksana Soegulnaja posted to qfa by charibeiro on 2006-02-14 16:09:20 as
	Characterizations of 1-Way Quantum Finite Automata [My Copy] No. TR-99-03. (February, 1999) by Alex Brodsky, Nicholas Pippenger posted to qfa by charibeiro on 2006-02-14 15:43:53 as
	Quantum Learning by Finite Automata [My Copy] by Richard Bonner, Rusins Freivalds posted to qfa by charibeiro on 2006-02-14 14:56:26 as
	Quantum finite multitape automata [My Copy] (7 May 1999) by Andris Ambainis, Richard Bonner, Rusins Freivalds, Marats Golovkins, Marek Karpinski posted to qfa by charibeiro on 2006-02-14 14:42:58 as
	Two-way finite automata with quantum and classical states [My Copy] (16 Nov 1999) by Andris Ambainis, John Watrous posted to qfa by charibeiro on 2006-02-14 14:40:53 as
	On the class of languages recognizable by 1-way quantum finite automata [My Copy] (1 Sep 2000) by Andris Ambainis, Arnolds Kikusts, Maris Valdats posted to qfa by charibeiro on 2006-02-14 14:35:47 as
	Exact results for accepting probabilities of quantum automata [My Copy] (11 Mar 2002) by Andris Ambainis, Arnolds Kikusts posted to qfa by charibeiro on 2006-02-14 14:32:42 as along with 1 person divall
	Probabilities to accept languages by quantum finite automata [My Copy] (16 Apr 1999) by Andris Ambainis, Richard Bonner, Rusins Freivalds, Arnolds Kikusts posted to qfa by charibeiro on 2006-02-14 14:29:40 as
	1-way quantum finite automata: strengths, weaknesses and generalizations [My Copy] (30 Sep 1998) by A. Ambainis, R. Freivalds posted to qfa by charibeiro on 2006-02-14 14:27:10 as
	Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata [My Copy] (25 Nov 1998) by Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh Vazirani posted to qfa by charibeiro on 2006-02-14 14:26:09 as
	The Complexity of Probabilistic versus Deterministic Finite Automata [My Copy] In ISAAC: 7th International Symposium on Algorithms and Computation (formerly {SIGAL} International Symposium on Algorithms), Organized by Special Interest Group on Algorithms ({SIGAL}) of the Information Processing Society of Japan ({IPSJ}) and the Technical Group on Theoretical Foundation of Computing of the Institute of Electronics, Information and Communication Engineers ({IEICE})) (1996) by Ambainis posted to qfa by charibeiro on 2006-02-14 14:07:57 as
	Size of Finite Probabilistic and Quantum Automata [My Copy] by Richard Bonner, Rusins Freivalds, Zigmars Rasscevskis posted to qfa by charibeiro on 2006-02-14 14:06:52 as
	Decidable and Undecidable Problems About Quantum Automata [My Copy] by Vincent D. Blondel, Emmanuel Jeandel, Pascal Koiran posted to qfa by charibeiro on 2006-02-13 21:03:36 as along with 1 person scis0000001
	On the Size of One-way Quantum Finite Automata with Periodic Behaviors [My Copy] Theoretical Informatics and Applications, Vol. 36, No. 3. (September 2002), pp. 277-291. by Carlo Mereghetti, Beatrice posted to qfa by charibeiro on 2006-02-13 20:27:02 as
	The class of languages recognizable by 1-way quantum finite automata is not closed under union [My Copy] (4 Jan 2000) by Maris Valdats posted to qfa by charibeiro on 2006-02-13 19:54:04 as
	Quantum automata and quantum grammars [My Copy] Theoretical Computer Science, Vol. 237, No. 1--2. (2000), pp. 275-306. by Cristopher Moore, James P. Crutchfield posted to qfa by charibeiro on 2006-02-13 18:50:30 as along with 1 person estrabd
	On the Power of Quantum Finite State Automata [My Copy] In IEEE Symposium on Foundations of Computer Science (1997), pp. 66-75. by Attila Kondacs, John Watrous posted to qfa by charibeiro on 2006-01-04 17:56:17 as

Note: You may cite this page as: http://www.citeulike.org/user/charibeiro

Sort by:
Order:	Default Ascending Descending
Empty fields:	Default First Last

charibeiro's library 35 articles Export Sort

charibeiro's tags