Tianrong Lin

  • Citations Per Year
Learn More
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)
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)
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