There exist an computational gap between the models that allowed to use quantum effects and that are not using quantum effects. Quantum Finite Automata (QFA), Quantum Pushdown Automata (QPDA), Quantum branching are several computational models. Some computational models are more powerful than classical counterparts and some are not. In this survey work, we have drawn a comparison among 1-way QF...

We prove some general results about quasi-actions on trees and define Property (QFA), which is analogous to Serre's Property (FA), but in the coarse setting. This property is shown to hold for a class of groups, including SL(n, Z) for n ≥ 3. We also give a way of thinking about Property (QFA) by breaking it down into statements about particular classes of trees. Contents 1. Introduction 1 1.1. ...

It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages recognizable by a QFA is not closed under union...

Quantitative Fitness Analysis (QFA) is an experimental and computational workflow for comparing fitnesses of microbial cultures grown in parallel(1,2,3,4). QFA can be applied to focused observations of single cultures but is most useful for genome-wide genetic interaction or drug screens investigating up to thousands of independent cultures. The central experimental method is the inoculation of...

One of the properties of the Kondacs-Watrous model of quantum finite automata (QFA) is that the probability of the correct answer for a QFA cannot be amplified arbitrarily. In this paper, we determine the maximum probabilities achieved by QFAs for several languages. In particular, we show that any language that is not recognized by an RFA (reversible finite automaton) can be recognized by a QFA...

We study the recognition of R-trivial idempotent (R1) languages by various models of ”decide-and-halt” quantum finite automata (QFA) and probabilistic reversible automata (DH-PRA). We introduce bistochastic QFA (MM-BQFA), a model which generalizes both Nayak’s enhanced QFA and DH-PRA. We apply tools from algebraic automata theory and systems of linear inequalities to give a complete characteriz...

Direct and straightforward methods to follow nucleic acid cleavage are needed. A spectrophotometric quadruplex formation assay (QFA) was developed, which allows real-time monitoring of site-specific cleavage of nucleic acids. QFA was applied to study both protein and nucleic acid restriction enzymes, and was demonstrated to accurately determine Michaelis-Menten parameters for the cleavage react...

Quantitative fitness analysis (QFA) is a high throughput experimental and computational methodology for measuring the growth of microbial populations. QFA screens can be used to compare the health of cell populations with and without a mutation in a query gene to infer genetic interaction strengths genomewide, examining thousands of separate genotypes. We introduce Bayesian hierarchical models ...

We prove some general results about quasi-actions on trees and define Property (QFA), which is analogous to Serre's Property (FA), but in the coarse setting. This property is shown to hold for a class of groups, including SL(n, Z) for n ≥ 3. We also give a way of thinking about Property (QFA) by breaking it down into statements about particular classes of trees. Contents 1. Introduction 1 1.1. ...

We consider notions of freeness and ambiguity for the acceptance probability Moore-Crutchfield Measure Once Quantum Finite Automata (MO-QFA). study injectivity problem determining if function a MO-QFA is injective over all input words, i.e., giving distinct each word. show that undecidable 8 state MO-QFA, even when unitary matrices projection matrix are rational initial vector real algebraic. a...