Daniel Kirsten

Publication Activity (10 Years)

Years Active: 1999-2014
Publications (10 Years): 0

Top Venues

Theor. Comput. Sci.

Dresden University of Technology, Germany (PHD)

Education History

Dresden University of Technology, Germany

PHD

Publications

Daniel Kirsten
An algebraic characterization of semirings for which the support of every recognizable series is recognizable. Theor. Comput. Sci. 534 (2014)
Daniel Kirsten
Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring. Theor. Comput. Sci. 420 (2012)
Daniel Kirsten
Some Variants of the Star Height Problem. MFCS (2011)
Daniel Kirsten, Karin Quaas
Recognizability of the support of recognizable series over the semiring of the integers is undecidable. Inf. Process. Lett. 111 (10) (2011)
Daniel Kirsten
The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable. Acta Cybern. 20 (2) (2011)
Daniel Kirsten
An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable. MFCS (2009)
Daniel Kirsten, Sylvain Lombardy
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata. STACS (2009)
Daniel Kirsten
The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable. Developments in Language Theory (2009)
Daniel Kirsten
A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata. RAIRO Theor. Informatics Appl. 42 (3) (2008)
Daniel Kirsten
A Burnside Approach to the Finite Substitution Problem. Theory Comput. Syst. 39 (1) (2006)
Daniel Kirsten, Ina Mäurer
On the Determinization of Weighted Automata. J. Autom. Lang. Comb. 10 (2/3) (2005)
Daniel Kirsten
Distance desert automata and the star height problem. RAIRO Theor. Informatics Appl. 39 (3) (2005)
Daniel Kirsten
Distance Desert Automata and the Star Height One Problem. FoSSaCS (2004)
Daniel Kirsten
Desert Automata and the Finite Substitution Problem. STACS (2004)
Daniel Kirsten, Jerzy Marcinkowski
Two techniques in the area of the star problem in trace monoids. Theor. Comput. Sci. 309 (1-3) (2003)
Daniel Kirsten
The finite power problem revisited. Inf. Process. Lett. 84 (6) (2002)
Daniel Kirsten
The Star Problem and the Finite Power Property in Trace Monoids: Reductions beyond C4. Inf. Comput. 176 (1) (2002)
Daniel Kirsten
Alternating Tree Automata and Parity Games. Automata, Logics, and Infinite Games (2001)
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) (2001)
Daniel Kirsten
The Star Problem in Trace Monoids: Reductions Beyond C4. ICALP (2001)
Daniel Kirsten
Some Undecidability Results Related to the Star Problem in Trace Monoids. STACS (1999)
Daniel Kirsten, Jerzy Marcinkowski
Two Techniques in the Area of the Star Problem. ICALP (1999)
Daniel Kirsten
A Connection between the Star Problem and the Finite Power Property in Trace Monoids. ICALP (1999)

Daniel Kirsten.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Daniel Kirsten