Nondeterministic computations in sublogarithmic space and space constructibility

2005 ◽  
pp. 111-124 ◽  
Author(s):  
Viliam Geffert
Keyword(s):  
Sublogarithmic Space

Computing with Sublogarithmic Space

1997 ◽  
pp. 197-224 ◽  
Author(s):  
Maciej Liśkiewicz ◽  
Rüdiger Reischuk
Keyword(s):  
Sublogarithmic Space

scholarly journals Some properties of one-pebble Turing machines with sublogarithmic space

2005 ◽  
Vol 341 (1-3) ◽  
pp. 138-149 ◽  
Author(s):  
Atsuyuki Inoue ◽  
Akira Ito ◽  
Katsushi Inoue ◽  
Tokio Okazaki
Keyword(s):  
Turing Machines ◽  
Sublogarithmic Space

scholarly journals Languages recognized by nondeterministic quantum finite automata

2010 ◽  
Vol 10 (9&10) ◽  
pp. 747-770
Author(s):  
Abuzer Yakaryilmaz ◽  
A.C. Cem Say
Keyword(s):  
Finite Automaton ◽  
Finite Automata ◽  
Space Complexity ◽  
Complexity Classes ◽  
Language Recognition ◽  
Closure Properties ◽  
Quantum Finite Automata ◽  
Sublogarithmic Space

The nondeterministic quantum finite automaton (NQFA) is the only known case where a one-way quantum finite automaton (QFA) model has been shown to be strictly superior in terms of language recognition power to its probabilistic counterpart. We give a characterization of the class of languages recognized by NQFAs, demonstrating that it is equal to the class of exclusive stochastic languages. We also characterize the class of languages that are recognized necessarily by two-sided error by QFAs. It is shown that these classes remain the same when the QFAs used in their definitions are replaced by several different model variants that have appeared in the literature. We prove several closure properties of the related classes. The ramifications of these results about classical and quantum sublogarithmic space complexity classes are examined.

Sign in / Sign up

Export Citation Format

Share Document