5 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.FL2022★ 5 cited
Non-Returning Finite Automata With Translucent Letters
František Mráz, Friedrich Otto
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…
cs.FL2017★ 2 cited
On h-Lexicalized Restarting Automata
Martin Plátek, Friedrich Otto
Following some previous studies on restarting automata, we introduce a refined model - the h-lexicalized restarting automaton (h-RLWW). We argue that this model is useful for expre…
math.RA2005
Uniform decision problems in automatic semigroups
Mark Kambites, Friedrich Otto
We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the…