… Restarting automata can be considered as a machine model as well as regulated rewriting
systems. We introduce a measure of ambiguity for restarting automata … an ambiguity measure …

… In this way it is also possible to determine dependencies between various parts of the given
sentence, and to disambiguate between certain morphological ambiguities contained in the …

… In order to study quantitative aspects of restarting automata, we introduce the concept of
a weighted restarting automaton. Such an automaton is given through a pair \((M,\omega )\), …

… so-called RRWW-automata. Here we present a survey on the restarting automaton and its
many variants. In particular, we will address the relationships between these automata and the …

… alternating tree automata, and how to transform an alternating automaton into a …
nondeterministic tree automata because we can complement a nondeterministic tree automaton as …

… j, the expressive power of restarting automata without auxiliary symbols is increased [12]. …
type of restarting automaton, the freely rewriting restarting automaton, FRR-automaton for short…

… The columns notation is more compact and gives a better overview about the ambiguity,
but it has also some disadvantages, as we will see during the explanation of disambiguation. …

… work is a generalization of restarting automata to trees, ie, first… tree automaton—the so-called
restarting tree automaton—… formal properties of the new automaton model. Furthermore, …

… called corpora) is the resolution of morphological ambiguity of words in a text corpus-either …
level (eg, the noun Leiter, ambiguous between feminine and masculine gender). There exist …

… a new type of restarting transducers – enhanced simple restarting automata that output …
The model presented in this article captures synonymy and ambiguity as a relation between …