The following pages link to Daniel Kirsten (Q764363):
Displaying 24 items.
- Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring (Q764364) (← links)
- The finite power problem revisited. (Q1853154) (← links)
- The star problem and the finite power property in trace monoids: Reductions beyond C4 (Q1854540) (← links)
- Two techniques in the area of the star problem in trace monoids (Q1884907) (← links)
- Recognizability of the support of recognizable series over the semiring of the integers is undecidable (Q1944933) (← links)
- A Burnside approach to the finite substitution problem (Q2432524) (← links)
- An algebraic characterization of semirings for which the support of every recognizable series is recognizable (Q2447754) (← links)
- The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable (Q2915544) (← links)
- (Q3067630) (← links)
- Some Variants of the Star Height Problem (Q3088026) (← links)
- An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable (Q3182949) (← links)
- (Q3410186) (← links)
- (Q3431481) (← links)
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata (Q3526417) (← links)
- The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable (Q3637236) (← links)
- (Q4251054) (← links)
- Alternating Tree Automata and Parity Games (Q4412832) (← links)
- (Q4535050) (← links)
- (Q4938641) (← links)
- (Q4938642) (← links)
- Foundations of Software Science and Computation Structures (Q5308455) (← links)
- STACS 2004 (Q5309709) (← links)
- Distance desert automata and the star height problem (Q5313718) (← links)
- Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata (Q5390010) (← links)
