✦ LIBER ✦

Quantum inductive inference by finite automata

✍ Scribed by R. Freivalds; R.F. Bonner

Book ID: 108281415
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 262 KB
Volume: 397
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.02.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Validating inductive hypotheses by mode

Validating inductive hypotheses by mode inference

✍ Wang Zhijian 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 250 KB

Inductive Inference by Using Information

Inductive Inference by Using Information Compression

✍ Ben Choi 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

Characterizations of 1-Way Quantum Finit

Characterizations of 1-Way Quantum Finite Automata

✍ Brodsky, Alex; Pippenger, Nicholas 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 234 KB

Characterizations of one-way general qua

Characterizations of one-way general quantum finite automata

✍ Lvzhou Li; Daowen Qiu; Xiangfu Zou; Lvjun Li; Lihua Wu; Paulo Mateus 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 323 KB

Realizations by stochastic finite automa

Realizations by stochastic finite automata

✍ J.W. Carlyle; A. Paz 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 729 KB

It is shown that a real-valued functionf(x), defined for strings x over a finite alphabet, is of the form (fig(x) + y) exp (3[ x ]) for constants fi, y, 3, and the acceptance probability function g for a probabilistic automaton, if and only iff is of finite rank, where the latter external criterion

Efficient probability amplification in t

Efficient probability amplification in two-way quantum finite automata

✍ Abuzer Yakaryılmaz; A.C. Cem Say 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 983 KB