default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Kirsten
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j12]Daniel Kirsten:
An algebraic characterization of semirings for which the support of every recognizable series is recognizable. Theor. Comput. Sci. 534: 45-52 (2014)- 2012
- [j11]Daniel Kirsten:
Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring. Theor. Comput. Sci. 420: 56-63 (2012) - 2011
- [j10]Daniel Kirsten:
The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable. Acta Cybern. 20(2): 211-221 (2011) - [j9]Daniel Kirsten, Karin Quaas:
Recognizability of the support of recognizable series over the semiring of the integers is undecidable. Inf. Process. Lett. 111(10): 500-502 (2011) - [c11]Daniel Kirsten:
Some Variants of the Star Height Problem. MFCS 2011: 19-33
2000 – 2009
- 2009
- [c10]Daniel Kirsten:
The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable. Developments in Language Theory 2009: 326-333 - [c9]Daniel Kirsten:
An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable. MFCS 2009: 489-500 - [c8]Daniel Kirsten, Sylvain Lombardy:
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata. STACS 2009: 589-600 - 2008
- [j8]Daniel Kirsten:
A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata. RAIRO Theor. Informatics Appl. 42(3): 553-581 (2008) - 2006
- [j7]Daniel Kirsten:
A Burnside Approach to the Finite Substitution Problem. Theory Comput. Syst. 39(1): 15-50 (2006) - 2005
- [j6]Daniel Kirsten:
Distance desert automata and the star height problem. RAIRO Theor. Informatics Appl. 39(3): 455-509 (2005) - [j5]Daniel Kirsten, Ina Mäurer:
On the Determinization of Weighted Automata. J. Autom. Lang. Comb. 10(2/3): 287-312 (2005) - 2004
- [c7]Daniel Kirsten:
Distance Desert Automata and the Star Height One Problem. FoSSaCS 2004: 257-272 - [c6]Daniel Kirsten:
Desert Automata and the Finite Substitution Problem. STACS 2004: 305-316 - 2003
- [j4]Daniel Kirsten, Jerzy Marcinkowski:
Two techniques in the area of the star problem in trace monoids. Theor. Comput. Sci. 309(1-3): 381-412 (2003) - 2002
- [j3]Daniel Kirsten:
The Star Problem and the Finite Power Property in Trace Monoids: Reductions beyond C4. Inf. Comput. 176(1): 22-36 (2002) - [j2]Daniel Kirsten:
The finite power problem revisited. Inf. Process. Lett. 84(6): 291-294 (2002) - 2001
- [j1]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): 193-227 (2001) - [c5]Daniel Kirsten:
Alternating Tree Automata and Parity Games. Automata, Logics, and Infinite Games 2001: 153-167 - [c4]Daniel Kirsten:
The Star Problem in Trace Monoids: Reductions Beyond C4. ICALP 2001: 591-602
1990 – 1999
- 1999
- [b1]Daniel Kirsten:
On decision problems of recognizable trace languages. Dresden University of Technology, Germany, 1999, pp. 1-30 - [c3]Daniel Kirsten:
A Connection between the Star Problem and the Finite Power Property in Trace Monoids. ICALP 1999: 473-482 - [c2]Daniel Kirsten, Jerzy Marcinkowski:
Two Techniques in the Area of the Star Problem. ICALP 1999: 483-492 - [c1]Daniel Kirsten:
Some Undecidability Results Related to the Star Problem in Trace Monoids. STACS 1999: 227-236
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
