Friedrich Otto
YOU?
Author Swipe
View article: On Repetitive Finite Automata with Translucent Words
On Repetitive Finite Automata with Translucent Words Open
We introduce and study the repetitive variants of the deterministic and the nondeterministic finite automaton with translucent words (DFAwtw and NFAwtw). On seeing the right sentinel, a repetitive NFAwtw need not halt immediately, acceptin…
View article: Repetitive Finite Automata With Translucent Letters
Repetitive Finite Automata With Translucent Letters Open
Here we propose an extension of the (deterministic and the nondeterministic)\nfinite automaton with translucent letters (DFAwtl and NFAwtl), which lies\nbetween these automata and their non-returning variants (that is, the nr-DFAwtl\nand t…
View article: Non-returning deterministic and nondeterministic finite automata with translucent letters
Non-returning deterministic and nondeterministic finite automata with translucent letters Open
Here, we propose a variant of the nondeterministic finite automaton with translucent letters (NFAwtl), which, after reading and deleting a letter, does not return to the left end of its tape, but instead continues from the position of the …
View article: Non-Returning Finite Automata With Translucent Letters
Non-Returning Finite Automata With Translucent Letters Open
Here we propose a variant of the nondeterministic finite automaton with\ntranslucent letters (NFAwtl) which, after reading and deleting a letter, does\nnot return to the left end of its tape, but rather continues from the position\nof the …
View article: On the Expressive Power of Stateless Ordered Restart-Delete Automata
On the Expressive Power of Stateless Ordered Restart-Delete Automata Open
Stateless ordered restart-delete automata (stl-ORD-automata) are studied. These are obtained from the stateless ordered restarting automata (stl-ORWW-automata) by introducing an additional restart-delete operation, which, based on the surr…
View article: Lexicalized Syntactic Analysis by Two-Way Restarting Automata
Lexicalized Syntactic Analysis by Two-Way Restarting Automata Open
We study \emph{h-lexicalized two-way restarting automat{a}} that can rewrite at most $i$ times per cycle for some $i\ge 1$ (\hRLWW$(i)$-automata). This model is useful for the study of lexical (syntactic) disambiguation, which is a concept…
View article: On restarting automata with auxiliary symbols and small window size
On restarting automata with auxiliary symbols and small window size Open
Here we show that for monotone RWW- (and RRWW-) automata, window size two is sufficient, both in the nondeterministic as well as in the deterministic case. For the former case, this is done by proving that each context-free language is alr…
View article: On h-Lexicalized Restarting List Automata
On h-Lexicalized Restarting List Automata Open
Following some previous studies on restarting list automata (RLA), we concentrate on a generalized and refined model -- the h-lexicalized restarting list automaton (hLxRLA), which is useful for expressing properties of lexicalized syntax i…
View article: On Two-Sided Locally Testable Languages
On Two-Sided Locally Testable Languages Open
We extend the two-sided strictly locally testable languages to the two-sided locally testable languages, showing that for each integer $k\ge 1$ and each symmetric binary relation $R$ on $\Sigma^k$, the family $2LT_R(k)$ of $k$-$R$-testable…
View article: On Deleting Deterministic Restarting Automata That Have Two Windows
On Deleting Deterministic Restarting Automata That Have Two Windows Open
We study deterministic restarting automata with two windows, abbreviated as det-2-RR-automata. In each cycle of a computation, a det-2-RR-automaton can perform up to two delete operations, one with each of its two windows. We study the cla…
View article: On h-Lexicalized Restarting Automata
On h-Lexicalized Restarting Automata Open
Following some previous studies on restarting automata, we introduce a\nrefined model - the h-lexicalized restarting automaton (h-RLWW). We argue that\nthis model is useful for expressing lexicalized syntax in computational\nlinguistics. W…
View article: Some classes of rational functions for pictures
Some classes of rational functions for pictures Open
With the aid of homogeneous morphisms, we turn the deterministic two-dimensional two-way ordered restarting automaton and its extended variant into devices that compute transductions of pictures, and we study the resulting classes of trans…