Developments in Language Theory

In this paper we analyze several models of 1-way quantum finite automata, in the light of formal power series theory. In this general context, we recall two well known constructions, by proving: 1. Languages generated with isolated cut-point by a class of bounded rational formal series are regular. 2. If a class of formal series is closed under f-complement, Hadamard product and convex linear combination, then the class of languages generated with isolated cut-point is closed under boolean operations. We introduce a general model of 1-way quantum automata and we compare their behaviors with those of measure-once, measure-many and reversible 1-way quantum automata.