 | 2009 |
|---|
| 18 |       | Daniel Kirsten:
The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable.
Developments in Language Theory 2009: 326-333 |
| 17 | | Daniel Kirsten:
An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable.
MFCS 2009: 489-500 |
| 16 | | Daniel Kirsten,
Sylvain Lombardy:
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata.
STACS 2009: 589-600 |
| 2008 |
|---|
| 15 | | Daniel Kirsten:
A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata.
ITA 42(3): 553-581 (2008) |
| 2006 |
|---|
| 14 | | Daniel Kirsten:
A Burnside Approach to the Finite Substitution Problem.
Theory Comput. Syst. 39(1): 15-50 (2006) |
| 2005 |
|---|
| 13 | | Daniel Kirsten:
Distance desert automata and the star height problem.
ITA 39(3): 455-509 (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 | | Daniel Kirsten:
Distance Desert Automata and the Star Height One Problem.
FoSSaCS 2004: 257-272 |
| 10 | | Daniel Kirsten:
Desert Automata and the Finite Substitution Problem.
STACS 2004: 305-316 |
| 2003 |
|---|
| 9 | | 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 | | Daniel Kirsten:
The Star Problem and the Finite Power Property in Trace Monoids: Reductions beyond C4.
Inf. Comput. 176(1): 22-36 (2002) |
| 7 | | Daniel Kirsten:
The finite power problem revisited.
Inf. Process. Lett. 84(6): 291-294 (2002) |
| 2001 |
|---|
| 6 | | Daniel Kirsten:
Alternating Tree Automata and Parity Games.
Automata, Logics, and Infinite Games 2001: 153-167 |
| 5 | | Daniel Kirsten:
The Star Problem in Trace Monoids: Reductions Beyond C4.
ICALP 2001: 591-602 |
| 4 | | 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 | | Daniel Kirsten:
A Connection between the Star Problem and the Finite Power Property in Trace Monoids.
ICALP 1999: 473-482 |
| 2 | | Daniel Kirsten,
Jerzy Marcinkowski:
Two Techniques in the Area of the Star Problem.
ICALP 1999: 483-492 |
| 1 | | Daniel Kirsten:
Some Undecidability Results Related to the Star Problem in Trace Monoids.
STACS 1999: 227-236 |
