593 research outputs found
From Finite Automata to Regular Expressions and Back--A Summary on Descriptional Complexity
The equivalence of finite automata and regular expressions dates back to the
seminal paper of Kleene on events in nerve nets and finite automata from 1956.
In the present paper we tour a fragment of the literature and summarize results
on upper and lower bounds on the conversion of finite automata to regular
expressions and vice versa. We also briefly recall the known bounds for the
removal of spontaneous transitions (epsilon-transitions) on non-epsilon-free
nondeterministic devices. Moreover, we report on recent results on the average
case descriptional complexity bounds for the conversion of regular expressions
to finite automata and brand new developments on the state elimination
algorithm that converts finite automata to regular expressions.Comment: In Proceedings AFL 2014, arXiv:1405.527
Functional Integration of Ecological Networks through Pathway Proliferation
Large-scale structural patterns commonly occur in network models of complex
systems including a skewed node degree distribution and small-world topology.
These patterns suggest common organizational constraints and similar functional
consequences. Here, we investigate a structural pattern termed pathway
proliferation. Previous research enumerating pathways that link species
determined that as pathway length increases, the number of pathways tends to
increase without bound. We hypothesize that this pathway proliferation
influences the flow of energy, matter, and information in ecosystems. In this
paper, we clarify the pathway proliferation concept, introduce a measure of the
node--node proliferation rate, describe factors influencing the rate, and
characterize it in 17 large empirical food-webs. During this investigation, we
uncovered a modular organization within these systems. Over half of the
food-webs were composed of one or more subgroups that were strongly connected
internally, but weakly connected to the rest of the system. Further, these
modules had distinct proliferation rates. We conclude that pathway
proliferation in ecological networks reveals subgroups of species that will be
functionally integrated through cyclic indirect effects.Comment: 29 pages, 2 figures, 3 tables, Submitted to Journal of Theoretical
Biolog
An extensive English language bibliography on graph theory and its applications
Bibliography on graph theory and its application
Digraphs are different: Why directionality matters in complex systems
Many networks describing complex systems are directed: the interactions
between elements are not symmetric. Recent work has shown that these networks
can display properties such as trophic coherence or non-normality, which in
turn affect stability, percolation and other dynamical features. I show here
that these topological properties have a common origin, in that the edges of
directed networks can be aligned - or not - with a global direction. And I
illustrate how this can lead to rich and unexpected dynamical behaviour even in
the simplest of models.Comment: Main text plus supplementary materia
- …