The SCEAS System
| |||||||

## Search the dblp DataBase
Daniel Kirsten:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Daniel Kirsten
**Alternating Tree Automata and Parity Games.**[Citation Graph (0, 0)][DBLP] Automata, Logics, and Infinite Games, 2001, pp:153-167 [Conf] - Daniel Kirsten
**Distance Desert Automata and the Star Height One Problem.**[Citation Graph (0, 0)][DBLP] FoSSaCS, 2004, pp:257-272 [Conf] - Daniel Kirsten
**The Star Problem in Trace Monoids: Reductions Beyond C4.**[Citation Graph (0, 0)][DBLP] ICALP, 2001, pp:591-602 [Conf] - Daniel Kirsten
**A Connection between the Star Problem and the Finite Power Property in Trace Monoids.**[Citation Graph (0, 0)][DBLP] ICALP, 1999, pp:473-482 [Conf] - Daniel Kirsten, Jerzy Marcinkowski
**Two Techniques in the Area of the Star Problem.**[Citation Graph (0, 0)][DBLP] ICALP, 1999, pp:483-492 [Conf] - Daniel Kirsten
**Desert Automata and the Finite Substitution Problem.**[Citation Graph (0, 0)][DBLP] STACS, 2004, pp:305-316 [Conf] - Daniel Kirsten
**Some Undecidability Results Related to the Star Problem in Trace Monoids.**[Citation Graph (0, 0)][DBLP] STACS, 1999, pp:227-236 [Conf] - Daniel Kirsten
**The Star Problem and the Finite Power Property in Trace Monoids: Reductions beyond C4.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2002, v:176, n:1, pp:22-36 [Journal] - Daniel Kirsten
**The finite power problem revisited.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:84, n:6, pp:291-294 [Journal] - Daniel Kirsten
**A Burnside Approach to the Finite Substitution Problem.**[Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2006, v:39, n:1, pp:15-50 [Journal] - Daniel Kirsten, Gwénaël Richomme
**Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids.**[Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2001, v:34, n:3, pp:193-227 [Journal] - Daniel Kirsten, Jerzy Marcinkowski
**Two techniques in the area of the star problem in trace monoids.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:309, n:1-3, pp:381-412 [Journal] **The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable.**[Citation Graph (, )][DBLP]**An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable.**[Citation Graph (, )][DBLP]**Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |