A Connection between the Star Problem and the Finite Power Property in Trace Monoids. - Daniel Kirsten (ICALP, 1999)

Two Techniques in the Area of the Star Problem. - Daniel Kirsten; Jerzy Marcinkowski (ICALP, 1999)

Some Undecidability Results Related to the Star Problem in Trace Monoids. - Daniel Kirsten (STACS, 1999)

On decision problems of recognizable trace languages. - Daniel Kirsten (1999)

Alternating Tree Automata and Parity Games. - Daniel Kirsten (Automata, Logics, and Infinite Games, 2001)

The Star Problem in Trace Monoids: Reductions Beyond C4. - Daniel Kirsten (ICALP, 2001)

Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids. - Daniel Kirsten; Gwénaël Richomme (Theory Comput. Syst., 2001)

The Star Problem and the Finite Power Property in Trace Monoids: Reductions beyond C4. - Daniel Kirsten (Inf. Comput., 2002)

The finite power problem revisited. - Daniel Kirsten (Inf. Process. Lett., 2002)

Two techniques in the area of the star problem in trace monoids. - Daniel Kirsten; Jerzy Marcinkowski (Theor. Comput. Sci., 2003)

Distance Desert Automata and the Star Height One Problem. - Daniel Kirsten (FoSSaCS, 2004)

Desert Automata and the Finite Substitution Problem. - Daniel Kirsten (STACS, 2004)

Distance desert automata and the star height problem. - Daniel Kirsten (RAIRO Theor. Informatics Appl., 2005)

On the Determinization of Weighted Automata. - Daniel Kirsten; Ina Mäurer (J. Autom. Lang. Comb., 2005)

A Burnside Approach to the Finite Substitution Problem. - Daniel Kirsten (Theory Comput. Syst., 2006)

A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata. - Daniel Kirsten (RAIRO Theor. Informatics Appl., 2008)

Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata. - Daniel Kirsten; Sylvain Lombardy (STACS, 2009)

Some Variants of the Star Height Problem. - Daniel Kirsten (MFCS, 2011)

The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable. - Daniel Kirsten (Acta Cybern., 2011)

Recognizability of the support of recognizable series over the semiring of the integers is undecidable. - Daniel Kirsten; Karin Quaas (Inf. Process. Lett., 2011)

Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring. - Daniel Kirsten (Theor. Comput. Sci., 2012)

An algebraic characterization of semirings for which the support of every recognizable series is recognizable. - Daniel Kirsten (Theor. Comput. Sci., 2014)