Classical and quantum computation with small space bounds (PhD thesis)

[1]  John C. Shepherdson,et al.  The Reduction of Two-Way Automata to One-Way Automata , 1959, IBM J. Res. Dev..

[2]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[3]  M. Rabin.  Real time computation , 1963 .

[4]  R. G. Bukharaev.  Theory of probabilistic automata , 1968 .

[5]  Paavo Turakainen,et al.  On Stochastic Languages , 1968, Inf. Control..

[6]  Paavo Turakainen,et al.  Generalized automata and stochastic languages , 1969 .

[7]  Paavo Turakainen.  On languages representable in rational probabilistic automata , 1969 .

[8]  Namio Honda,et al.  A Context-Free Language Which is not Acceptable by a Probabilistic Automaton , 1971, Inf. Control..

[9]  Paavo Turakainen.  Some Closure Properties of the Family of Stochastic Languages , 1971, Inf. Control..

[10]  Azaria Paz,et al.  Introduction to Probabilistic Automata , 1971 .

[11]  R. Lyndon,et al.  Combinatorial Group Theory , 1977 .

[12]  Franz-Josef Brandenburg.  On one-way auxiliary pushdown automata , 1977, Theoretical Computer Science.

[13]  Richard J. Lipton,et al.  Word Problems Solvable in Logspace , 1977, JACM.

[14]  Phan Dinh Diêu.  Criteria of representability of languages in probabilistic automata , 1977 .

[15]  Sheila A. Greibach.  Remarks on Blind and Partially Blind One-Way Multicounter Machines , 1978, Theor. Comput. Sci..

[16]  Rusins Freivalds,et al.  Fast Probabilistic Algorithms , 1979, MFCS.

[17]  Rusins Freivalds,et al.  Probabilistic Two-Way Machines , 1981, MFCS.

[18]  Paavo Turakainen.  On nonstochastic languages and homomorphic images of stochastic languages , 1981, Inf. Sci..

[19]  Tat-hung Chan,et al.  Reversal complexity of counter machines , 1981, STOC '81.

[20]  Joaquim Gabarró,et al.  Pushdown Space Complexity and Related Full-AFLs , 1984, STACS.

[21]  YA. YA. KANEPS,et al.  Stochasticity of the languages acceptable by two-way finite probabilistic automata , 1991 .

[22]  Bala Ravikumar.  Some Observations on 2-way Probabilistic Finite Automata , 1992, FSTTCS.

[23]  Kurt Mehlhorn,et al.  A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition , 1992, Inf. Process. Lett..

[24]  Ioan I. Macarie.  Closure Properties of Stochastic Languages , 1993 .

[25]  S. Świerczkowski.  A class of free rotation groups , 1994 .

[26]  Marek Karpinski,et al.  Lower Space Bounds for Randomized Computation , 1994, ICALP.

[27]  Andrzej Szepietowski.  Turing Machines with Sublogarithmic Space , 1994, Lecture Notes in Computer Science.

[28]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[29]  John Watrous,et al.  On the power of quantum finite state automata , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[30]  Umesh V. Vazirani,et al.  Quantum Complexity Theory , 1997, SIAM J. Comput..

[31]  Eric Bach,et al.  Space-bounded quantum computation , 1998 .

[32]  Noam Nisan,et al.  Quantum circuits with mixed states , 1998, STOC '98.

[33]  Andris Ambainis,et al.  1-way quantum finite automata: strengths, weaknesses and generalizations , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[34]  Kazuo Iwama,et al.  Undecidability on quantum finite automata , 1999, STOC '99.

[35]  John Watrous,et al.  Space-Bounded Quantum Complexity , 1999, J. Comput. Syst. Sci..

[36]  I. Chuang,et al.  Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition , 2010 .

[37]  James P. Crutchfield,et al.  Quantum automata and quantum grammars , 2000, Theor. Comput. Sci..

[38]  Kathrin Paschen.  Quantum finite automata using ancilla qubits , 2000 .

[39]  Masaki Nakanishi,et al.  On the power of quantum pushdown automata with a classical stack and 1.5-way quantum finite automata , 2001 .

[40]  Carlo Mereghetti,et al.  Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata , 2001, RAIRO Theor. Informatics Appl..

[41]  Marco Carpentieri,et al.  Regular Languages Accepted by Quantum Automata , 2001, Inf. Comput..

[42]  Andris Ambainis,et al.  Two-way finite automata with quantum and classical state , 1999, Theor. Comput. Sci..

[43]  Tsunehiro Yoshinaga.  On the Power of Non-deterministic Quantum Finite Automata , 2002 .

[44]  Andris Ambainis,et al.  Dense quantum coding and quantum finite automata , 2002, JACM.

[45]  Alex Brodsky,et al.  Characterizations of 1-Way Quantum Finite Automata , 2002, SIAM J. Comput..

[46]  John Watrous,et al.  On the complexity of simulating space-bounded quantum computations , 2004, computational complexity.

[47]  A. Paz.  Probabilistic algorithms , 2003 .

[48]  Azaria Paz,et al.  Probabilistic automata , 2003 .

[49]  Michel Fliess,et al.  Propriétés booléennes des langages stochastiques , 1973, Mathematical systems theory.

[50]  Vincent D. Blondel,et al.  Decidable and Undecidable Problems about Quantum Automata , 2005, SIAM J. Comput..

[51]  François Le Gall,et al.  Exponential separation of quantum and classical online space complexity , 2006, SPAA '06.

[52]  Flavio D'Alessandro,et al.  A Non-commutativity Statement for Algebraic Quaternions , 2006, Int. J. Algebra Comput..

[53]  Dieter van Melkebeek,et al.  A Quantum Time-Space Lower Bound for the Counting Hierarchy , 2008, Electron. Colloquium Comput. Complex..

[54]  Mika Hirvensalo,et al.  Various Aspects of Finite Quantum Automata , 2008, Developments in Language Theory.

[55]  Daowen Qiu,et al.  Determining the equivalence for one-way quantum finite automata , 2007, Theor. Comput. Sci..

[56]  Maris Ozols,et al.  Improved constructions of mixed state quantum automata , 2009, Theor. Comput. Sci..

[57]  A. C. Cem Say,et al.  Languages recognized by nondeterministic quantum finite automata , 2009, Quantum Inf. Comput..

[58]  A. C. Cem Say,et al.  Languages Recognized with Unbounded Error by Quantum Finite Automata , 2008, CSR.

[59]  Rusins Freivalds,et al.  A new family of nonstochastic languages , 2010, Inf. Process. Lett..

[60]  A. C. Cem Say,et al.  Succinctness of two-way probabilistic and quantum finite automata , 2009, Discret. Math. Theor. Comput. Sci..

[61]  Rusins Freivalds,et al.  Postselection Finite Quantum Automata , 2010, UC.

[62]  Rusins Freivalds,et al.  Quantum Computation with Devices Whose Contents Are Never Read , 2010, UC.

[63]  A. C. Cem Say,et al.  Unbounded-error quantum computation with small space bounds , 2010, Inf. Comput..