Daniel Kirsten

24 papers A* 3A 3B 3C 1Journal 12Unranked 1
YearRankTypeTitle / Venue / Authors
2014 J jnl
An algebraic characterization of semirings for which the support of every recognizable series is recognizable.
Theor. Comput. Sci.
Daniel Kirsten
2012 J jnl
Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring.
Theor. Comput. Sci.
Daniel Kirsten
2011 J jnl
Recognizability of the support of recognizable series over the semiring of the integers is undecidable.
Inf. Process. Lett.
Daniel Kirsten, Karin Quaas
2011 B conf
Some Variants of the Star Height Problem.
MFCS
Daniel Kirsten
2011 J jnl
The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable.
Acta Cybern.
Daniel Kirsten
2009 B conf
An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable.
MFCS
Daniel Kirsten
2009 A conf
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata.
STACS
Daniel Kirsten, Sylvain Lombardy
2009 C conf
The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable.
Developments in Language Theory
Daniel Kirsten
2008 J jnl
A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata.
RAIRO Theor. Informatics Appl.
Daniel Kirsten
2006 J jnl
A Burnside Approach to the Finite Substitution Problem.
Theory Comput. Syst.
Daniel Kirsten
2005 J jnl
Distance desert automata and the star height problem.
RAIRO Theor. Informatics Appl.
Daniel Kirsten
2005 J jnl
On the Determinization of Weighted Automata.
J. Autom. Lang. Comb.
Daniel Kirsten, Ina Mäurer
2004 A conf
Desert Automata and the Finite Substitution Problem.
STACS
Daniel Kirsten
2004 B conf
Distance Desert Automata and the Star Height One Problem.
FoSSaCS
Daniel Kirsten
2003 J jnl
Two techniques in the area of the star problem in trace monoids.
Theor. Comput. Sci.
Daniel Kirsten, Jerzy Marcinkowski
2002 J jnl
The Star Problem and the Finite Power Property in Trace Monoids: Reductions beyond C4.
Inf. Comput.
Daniel Kirsten
2002 J jnl
The finite power problem revisited.
Inf. Process. Lett.
Daniel Kirsten
2001 — conf
Alternating Tree Automata and Parity Games.
Automata, Logics, and Infinite Games
Daniel Kirsten
2001 J jnl
Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids.
Theory Comput. Syst.
Daniel Kirsten, Gwénaël Richomme
2001 A* conf
The Star Problem in Trace Monoids: Reductions Beyond C4.
ICALP
Daniel Kirsten
1999 A* conf
A Connection between the Star Problem and the Finite Power Property in Trace Monoids.
ICALP
Daniel Kirsten
1999 — —
On decision problems of recognizable trace languages.
Daniel Kirsten
1999 A conf
Some Undecidability Results Related to the Star Problem in Trace Monoids.
STACS
Daniel Kirsten
1999 A* conf
Two Techniques in the Area of the Star Problem.
ICALP
Daniel Kirsten, Jerzy Marcinkowski