Tianrong Lin

发表

J an 2 01 2 Another approach to the equivalence of measure-many one-way quantum finite automata and its application ✩

Tianrong Lin, 2012 .

On equivalence and emptiness problems of multi-letter (measure many) quantum finite automata

Tianrong Lin, 2012, 1203.0113.

Undecidability of $L(\mathcal{A})=L(\mathcal{B})$ recognized by measure many 1-way quantum automata

Tianrong Lin, 2013, 1308.3301.

Diagonalization of Polynomial-Time Turing Machines Via Nondeterministic Turing Machine

Tianrong Lin, 2021, ArXiv.

Resolution of The Linear-Bounded Automata Question

Tianrong Lin, 2021, ArXiv.

Diagonalization of Polynomial-Time Turing Machines Via Nondeterministic Turing Machine

Tianrong Lin, 2021, ArXiv.

Diagonalization of Polynomial-Time Deterministic Turing Machines Via Nondeterministic Turing Machine

Tianrong Lin, 2021, 2110.06211.

Diagonalization of Polynomial-Time Deterministic Turing Machines Via Nondeterministic Turing Machine

Tianrong Lin, 2021, 2110.06211.

Resolution of The Linear-Bounded Automata Question in The Sense of Equivalence

Tianrong Lin, 2021, 2110.05942.

On Baker-Gill-Solovay Oracle Turing Machines and Relativization Barrier

Tianrong Lin, 2021, ArXiv.

Diagonalization of Polynomial-Time Deterministic Turing Machines Via Nondeterministic Turing Machine

Tianrong Lin, 2021, 2110.06211.

The Separation of $\mathcal{NP}$ and $\mathcal{PSPACE}$

Tianrong Lin, 2021, 2106.11886.

Diagonalization of Polynomial-Time Deterministic Turing Machines Via Nondeterministic Turing Machine

Tianrong Lin, 2021, 2110.06211.

Model-Checking Branching-Time Properties of Stateless Quantum Pushdown Systems 1

Tianrong Lin, 2022, 2209.10517.

Model-Checking Branching-Time Properties of Stateless Probabilistic Pushdown Systems and Its Quantum Extension

Tianrong Lin, 2022, ArXiv.

On Baker-Gill-Solovay Oracle Turing Machines and Relativization Barrier

Tianrong Lin, 2021, ArXiv.

Diagonalization of Polynomial-Time Deterministic Turing Machines Via Nondeterministic Turing Machine

Tianrong Lin, 2021, 2110.06211.

Corrigendum to "Another approach to the equivalence of measure-many one-way quantum infinite automata and its application" [J. Comput. Syst. Sci. 78(3) (2012) 807-821]

Tianrong Lin, 2015, J. Comput. Syst. Sci..

On equivalence, languages equivalence and minimization of multi-letter and multi-letter measure-many quantum automata

Tianrong Lin, 2012, 1203.0113.

Another approach to the equivalence of measure-many one-way quantum finite automata and its application

Tianrong Lin, Tianrong Lin, 2011, J. Comput. Syst. Sci..

Model-Checking PCTL properties of Stateless Probabilistic Pushdown Systems with Various Extensions

Tianrong Lin, 2022, 2209.10517.

Diagonalization of Polynomial-Time Deterministic Turing Machines Via Nondeterministic Turing Machine

Tianrong Lin, 2021, 2110.06211.

Quantum and Probabilistic Computers Rigorously Powerful than Traditional Computers, and Derandomization

Tianrong Lin, 2023, arXiv.org.

On Baker-Gill-Solovay Oracle Turing Machines and Relativization Barrier

Tianrong Lin, 2021, ArXiv.

The Separation of N P and PSPACE

Tianrong Lin, 2023 .

Resolution of The Linear-Bounded Automata Question

Tianrong Lin, 2021, arXiv.org.

The Separation of NP and PSPACE pdf

Tianrong Lin, Tianrong Lin, 2021, ArXiv.

Diagonalizing Against Polynomial-Time Bounded Turing Machines Via Nondeterministic Turing Machine

Tianrong Lin, 2021 .

The Separation of NP and PSPACE

Tianrong Lin, 2021, arXiv.org.

A Negative Answer to P ? = P SP ACE

Tianrong Lin, 2021 .

A Negative Answer to P ? = PSPACE

Tianrong Lin, 2021 .

Quantum and Probabilistic Computers Rigorously Powerful than Traditional Computers, and Derandomization

Tianrong Lin, 2023, ArXiv.

Resolution of The Linear-Bounded Automata Question in The Sense of Equivalence

Tianrong Lin, 2021, 2110.05942.

Resolution of The Linear-Bounded Automata Question

Tianrong Lin, 2021, ArXiv.

C C ] 2 8 Ju n 20 21 A Negative Answer to P ? = PSPACE

Tianrong Lin, 2021 .