Daniel Kirsten

According to our database, Daniel Kirsten authored at least 22 papers between 1999 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2014

An algebraic characterization of semirings for which the support of every recognizable series is recognizable.

Daniel Kirsten

Theor. Comput. Sci., 2014

2012

Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring.

Daniel Kirsten

Theor. Comput. Sci., 2012

2011

Recognizability of the support of recognizable series over the semiring of the integers is undecidable.

Daniel Kirsten, Karin Quaas

Inf. Process. Lett., 2011

The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable.

Daniel Kirsten

Acta Cybern., 2011

Some Variants of the Star Height Problem.

Daniel Kirsten

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2009

Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata.

Daniel Kirsten, Sylvain Lombardy

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008

A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata.

Daniel Kirsten

RAIRO Theor. Informatics Appl., 2008

2006

A Burnside Approach to the Finite Substitution Problem.

Daniel Kirsten

Theory Comput. Syst., 2006

2005

On the Determinization of Weighted Automata.

Daniel Kirsten, Ina Mäurer

J. Autom. Lang. Comb., 2005

Distance desert automata and the star height problem.

Daniel Kirsten

RAIRO Theor. Informatics Appl., 2005

2004

Desert Automata and the Finite Substitution Problem.

Daniel Kirsten

Proceedings of the STACS 2004, 2004

Distance Desert Automata and the Star Height One Problem.

Daniel Kirsten

Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003

Two techniques in the area of the star problem in trace monoids.

Daniel Kirsten, Jerzy Marcinkowski

Theor. Comput. Sci., 2003

2002

The finite power problem revisited.

Daniel Kirsten

Inf. Process. Lett., 2002

The Star Problem and the Finite Power Property in Trace Monoids: Reductions beyond C4.

Daniel Kirsten

Inf. Comput., 2002

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 in Trace Monoids: Reductions Beyond C4.

Daniel Kirsten

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Alternating Tree Automata and Parity Games.

Daniel Kirsten

Proceedings of the Automata, 2001

1999

On decision problems of recognizable trace languages.

Daniel Kirsten

PhD thesis, 1999

Some Undecidability Results Related to the Star Problem in Trace Monoids.

Daniel Kirsten

Proceedings of the STACS 99, 1999

Two Techniques in the Area of the Star Problem.

Daniel Kirsten, Jerzy Marcinkowski

Proceedings of the Automata, 1999

A Connection between the Star Problem and the Finite Power Property in Trace Monoids.

Daniel Kirsten

Proceedings of the Automata, 1999