2009 | ||
---|---|---|
14 | EE | Daniel Kirsten, Sylvain Lombardy: Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata. STACS 2009: 589-600 |
2006 | ||
13 | EE | Daniel Kirsten: A Burnside Approach to the Finite Substitution Problem. Theory Comput. Syst. 39(1): 15-50 (2006) |
2005 | ||
12 | Daniel Kirsten, Ina Mäurer: On the Determinization of Weighted Automata. Journal of Automata, Languages and Combinatorics 10(2/3): 287-312 (2005) | |
2004 | ||
11 | EE | Daniel Kirsten: Distance Desert Automata and the Star Height One Problem. FoSSaCS 2004: 257-272 |
10 | EE | Daniel Kirsten: Desert Automata and the Finite Substitution Problem. STACS 2004: 305-316 |
2003 | ||
9 | EE | Daniel Kirsten, Jerzy Marcinkowski: Two techniques in the area of the star problem in trace monoids. Theor. Comput. Sci. 309(1-3): 381-412 (2003) |
2002 | ||
8 | EE | Daniel Kirsten: The Star Problem and the Finite Power Property in Trace Monoids: Reductions beyond C4. Inf. Comput. 176(1): 22-36 (2002) |
7 | EE | Daniel Kirsten: The finite power problem revisited. Inf. Process. Lett. 84(6): 291-294 (2002) |
2001 | ||
6 | EE | Daniel Kirsten: Alternating Tree Automata and Parity Games. Automata, Logics, and Infinite Games 2001: 153-167 |
5 | EE | Daniel Kirsten: The Star Problem in Trace Monoids: Reductions Beyond C4. ICALP 2001: 591-602 |
4 | EE | Daniel Kirsten, Gwénaël Richomme: Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids. Theory Comput. Syst. 34(3): 193-227 (2001) |
1999 | ||
3 | EE | Daniel Kirsten: A Connection between the Star Problem and the Finite Power Property in Trace Monoids. ICALP 1999: 473-482 |
2 | EE | Daniel Kirsten, Jerzy Marcinkowski: Two Techniques in the Area of the Star Problem. ICALP 1999: 483-492 |
1 | EE | Daniel Kirsten: Some Undecidability Results Related to the Star Problem in Trace Monoids. STACS 1999: 227-236 |
1 | Sylvain Lombardy | [14] |
2 | Jerzy Marcinkowski | [2] [9] |
3 | Ina Mäurer | [12] |
4 | Gwénaël Richomme | [4] |