2 research outputs found
State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters
Deterministic and nondeterministic finite automata with translucent letters
were introduced by Nagy and Otto more than a decade ago as Cooperative
Distributed systems of a kind of stateless restarting automata with window size
one. These finite state machines have a surprisingly large expressive power:
all commutative semi-linear languages and all rational trace languages can be
accepted by them including various not context-free languages. While the
nondeterministic variant defines a language class with nice closure properties,
the deterministic variant is weaker, however it contains all regular languages,
some non-regular context-free languages, as the Dyck language, and also some
languages that are not even context-free. In all those models for each state,
the letters of the alphabet could be in one of the following categories: the
automaton cannot see the letter (it is translucent), there is a transition
defined on the letter (maybe more than one transitions in nondeterministic
case) or none of the above categories (the automaton gets stuck by seeing this
letter at the given state and this computation is not accepting).
State-deterministic automata are recent models, where the next state of the
computation determined by the structure of the automata and it is independent
of the processed letters. In this paper our aim is twofold, on the one hand, we
investigate state-deterministic finite automata with translucent letters. These
automata are specially restricted deterministic finite automata with
translucent letters.
In the other novel model we present, it is allowed that for a state the set
of translucent letters and the set of letters for which transition is defined
are not disjoint. One can interpret this fact that the automaton has a
nondeterministic choice for each occurrence of such letters to see them (and
then erase and make the transition) or not to see that occurrence at that time.
Based on these semi-translucent letters, the expressive power of the automata
increases, i.e., in this way a proper generalization of the previous models is
obtained.Comment: In Proceedings AFL 2023, arXiv:2309.0112
Evolution from the ground up with Amee – From basic concepts to explorative modeling
Evolutionary theory has been the foundation of biological research for about a century
now, yet over the past few decades, new discoveries and theoretical advances have rapidly
transformed our understanding of the evolutionary process. Foremost among them are
evolutionary developmental biology, epigenetic inheritance, and various forms of evolu-
tionarily relevant phenotypic plasticity, as well as cultural evolution, which ultimately led
to the conceptualization of an extended evolutionary synthesis. Starting from abstract
principles rooted in complexity theory, this thesis aims to provide a unified conceptual
understanding of any kind of evolution, biological or otherwise. This is used in the second
part to develop Amee, an agent-based model that unifies development, niche construction,
and phenotypic plasticity with natural selection based on a simulated ecology. Amee
is implemented in Utopia, which allows performant, integrated implementation and
simulation of arbitrary agent-based models. A phenomenological overview over Amee’s
capabilities is provided, ranging from the evolution of ecospecies down to the evolution
of metabolic networks and up to beyond-species-level biological organization, all of
which emerges autonomously from the basic dynamics. The interaction of development,
plasticity, and niche construction has been investigated, and it has been shown that while
expected natural phenomena can, in principle, arise, the accessible simulation time and
system size are too small to produce natural evo-devo phenomena and –structures. Amee thus can be used to simulate the evolution of a wide variety of processes