#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2011

2015

- This year (0)
- Last 5 years (6)
- Last 10 years (10)

#### Publication Type

#### Journals and Conferences

#### Key Phrases

Learn More

- Tianrong Lin
- J. Comput. Syst. Sci.
- 2012

- Tianrong Lin
- ArXiv
- 2011

- Tianrong Lin
- 2013

This note revisits the equivalence of languages recognized by measure many one way quantum finite automata with non/strict cutpoint. The main contributions are as follows: (1) We provide an additional proof of the undecidability of non/strict emptiness of measure many one way quantum finite automata; (2) By the undecidability of non/strict emptiness of… (More)

- Tianrong Lin
- ArXiv
- 2011

Two quantum finite automata are equivalent if for all input string ω over the input alphabet the two automata accept ω with equal probability. In [Theoret. Comput. Sci. 410 (2009) 3006-3017], it was shown that a k1-letter QFA A1 and a k2-letter QFA A2 over Σ = {σ}, are equivalent if and only if they are (n1 + n2) 4 + k − 1-equivalent where ni is the number… (More)

- Tianrong Lin
- ArXiv
- 2013

- Tianrong Lin
- ArXiv
- 2012

- Tianrong Lin
- 2011

In a recent letter by Ying et al. [Inf. Process. Lett. 104 (2007) 152-158], it showed some sufficient conditions for commutativity of quantum weakest preconditions. This paper provides some simple characterizations for the commutativity of quantum weakest preconditions, i.e., Theorem 3, Theorem 4 and Proposition 5 in what follows. We also show that to… (More)

- Tianrong Lin
- 2012

In this paper, we study some decision problems both for multi-letter quantum finite automata and measure many multi-letter quantum finite automata. We first show that given a k1-letter quantum finite automaton A1 and a k2-letter quantum finite automaton A2 over the same input alphabet Σ, they are equivalent if and only if they are (n21 + n 2 2 − 1)|Σ| k−1 +… (More)

- Tianrong Lin
- ArXiv
- 2011

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

In this paper, we present a much simpler, direct and elegant approach to the equivalence problem of measure many one-way quantum finite automata (MM1QFAs). The approach is essentially generalized from the work of Carlyle [J. Math. Anal. Appl. 7 (1963) 167-175]. Namely, we reduce the equivalence problem of MM-1QFAs to that of two (initial) vectors. As an… (More)

- ‹
- 1
- ›