#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2012

2014

- This year (0)
- Last 5 years (3)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Stefan Repke
- 2014

Automata simplication 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. Simplication can… (More)

- Christof Löding, Stefan Repke
- MFCS
- 2012

We show that the regularity and equivalence problems are decidable for deterministic weak pushdown ω-automata, giving a partial answer to a question raised by Cohen and Gold in 1978. We prove the decidability by a reduction to the corresponding problems for deterministic pushdown automata on finite words. Furthermore, we consider the problem of deciding for… (More)

- Christof Löding, Stefan Repke
- FSTTCS
- 2013

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
- ›