Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Repke, Stefan"'
Autor:
Repke, Stefan
Publikováno v:
Aachen : Publikationsserver der RWTH Aachen University VII, 93 S. : graph. Darst. (2014). = Aachen, Techn. Hochsch., Diss., 2014
Automata simplification 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 synthesiz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______791::3c6f4e36041b8ba29c24b895263eee8e
Autor:
Löding, Christof, Repke, Stefan
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 t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::832e7dcc7124a372fabfdb7c78f11f92
Autor:
Löding, Christof, Repke, Stefan
Publikováno v:
Mathematical Foundations of Computer Science 2012; 2012, p764-776, 13p
