5,055 research outputs found
Learning probability distributions generated by finite-state machines
We review methods for inference of probability distributions generated by probabilistic automata and related models for sequence generation. We focus on methods that can be proved to learn in the inference
in the limit and PAC formal models. The methods we review are state merging and state splitting methods for probabilistic deterministic automata and the recently developed spectral method for nondeterministic probabilistic automata. In both cases, we derive them from a high-level algorithm described in terms of the Hankel matrix of the distribution to be learned, given as an oracle, and then describe how to adapt that algorithm to account for the error introduced by a finite sample.Peer ReviewedPostprint (author's final draft
DNA ANALYSIS USING GRAMMATICAL INFERENCE
An accurate language definition capable of distinguishing between coding and non-coding DNA has important applications and analytical significance to the field of computational biology. The method proposed here uses positive sample grammatical inference and statistical information to infer languages for coding DNA.
An algorithm is proposed for the searching of an optimal subset of input sequences for the inference of regular grammars by optimizing a relevant accuracy metric. The algorithm does not guarantee the finding of the optimal subset; however, testing shows improvement in accuracy and performance over the basis algorithm.
Testing shows that the accuracy of inferred languages for components of DNA are consistently accurate. By using the proposed algorithm languages are inferred for coding DNA with average conditional probability over 80%. This reveals that languages for components of DNA can be inferred and are useful independent of the process that created them. These languages can then be analyzed or used for other tasks in computational biology.
To illustrate potential applications of regular grammars for DNA components, an inferred language for exon sequences is applied as post processing to Hidden Markov exon prediction to reduce the number of wrong exons detected and improve the specificity of the model significantly
Implications of quantum automata for contextuality
We construct zero-error quantum finite automata (QFAs) for promise problems
which cannot be solved by bounded-error probabilistic finite automata (PFAs).
Here is a summary of our results:
- There is a promise problem solvable by an exact two-way QFA in exponential
expected time, but not by any bounded-error sublogarithmic space probabilistic
Turing machine (PTM).
- There is a promise problem solvable by an exact two-way QFA in quadratic
expected time, but not by any bounded-error -space PTMs in
polynomial expected time. The same problem can be solvable by a one-way Las
Vegas (or exact two-way) QFA with quantum head in linear (expected) time.
- There is a promise problem solvable by a Las Vegas realtime QFA, but not by
any bounded-error realtime PFA. The same problem can be solvable by an exact
two-way QFA in linear expected time but not by any exact two-way PFA.
- There is a family of promise problems such that each promise problem can be
solvable by a two-state exact realtime QFAs, but, there is no such bound on the
number of states of realtime bounded-error PFAs solving the members this
family.
Our results imply that there exist zero-error quantum computational devices
with a \emph{single qubit} of memory that cannot be simulated by any finite
memory classical computational model. This provides a computational perspective
on results regarding ontological theories of quantum mechanics \cite{Hardy04},
\cite{Montina08}. As a consequence we find that classical automata based
simulation models \cite{Kleinmann11}, \cite{Blasiak13} are not sufficiently
powerful to simulate quantum contextuality. We conclude by highlighting the
interplay between results from automata models and their application to
developing a general framework for quantum contextuality.Comment: 22 page
Cellular Automata Models of Road Traffic
In this paper, we give an elaborate and understandable review of traffic
cellular automata (TCA) models, which are a class of computationally efficient
microscopic traffic flow models. TCA models arise from the physics discipline
of statistical mechanics, having the goal of reproducing the correct
macroscopic behaviour based on a minimal description of microscopic
interactions. After giving an overview of cellular automata (CA) models, their
background and physical setup, we introduce the mathematical notations, show
how to perform measurements on a TCA model's lattice of cells, as well as how
to convert these quantities into real-world units and vice versa. The majority
of this paper then relays an extensive account of the behavioural aspects of
several TCA models encountered in literature. Already, several reviews of TCA
models exist, but none of them consider all the models exclusively from the
behavioural point of view. In this respect, our overview fills this void, as it
focusses on the behaviour of the TCA models, by means of time-space and
phase-space diagrams, and histograms showing the distributions of vehicles'
speeds, space, and time gaps. In the report, we subsequently give a concise
overview of TCA models that are employed in a multi-lane setting, and some of
the TCA models used to describe city traffic as a two-dimensional grid of
cells, or as a road network with explicitly modelled intersections. The final
part of the paper illustrates some of the more common analytical approximations
to single-cell TCA models.Comment: Accepted for publication in "Physics Reports". A version of this
paper with high-quality images can be found at: http://phdsven.dyns.cx (go to
"Papers written"
- …