Stefan Repke

Learn More
Automata simplication asks whether a given automaton can be converted into one of a simpler format, i.e., whether a certain feature of the automaton model is avoidable in the given case. If yes, an automaton of this simpler format shall be synthesized. e idea is that simpler automata models have better closure and algorithmic properties. Simplication can(More)
In this paper, we study lookahead delegators for nondeterministic finite automata (NFA), which are functions that deterministically choose transitions by additionally using a bounded lookahead on the input word. Of course, the delegator has to lead to an accepting state for each word that is accepted by the NFA. In the special case where no lookahead is(More)
  • 1