The following pages link to Thorsten Wißmann (Q328656):
Displaying 25 items.
- Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets (Q328657) (← links)
- Predicate liftings and functor presentations in coalgebraic expression languages (Q1798785) (← links)
- From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
- Path category for free. Open morphisms from coalgebras with non-deterministic branching (Q2289101) (← links)
- A new foundation for finitary corecursion and iterative algebras (Q2304521) (← links)
- A New Foundation for Finitary Corecursion (Q2811335) (← links)
- Nominal Automata with Name Binding (Q2988364) (← links)
- (Q4637688) (← links)
- Minimality Notions via Factorization Systems and Examples (Q5043590) (← links)
- Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence (Q5060192) (← links)
- Efficient Coalgebraic Partition Refinement (Q5111646) (← links)
- (Q5214815) (← links)
- A coalgebraic view on reachability (Q5218979) (← links)
- On Finitary Functors (Q5243045) (← links)
- Finitely Presentable Algebras For Finitary Monads (Q5243048) (← links)
- Finitary Corecursion for the Infinitary Lambda Calculus (Q5275360) (← links)
- (Q6061681) (← links)
- (Q6159944) (← links)
- (Q6176116) (← links)
- Minimality Notions via Factorization Systems (Q6370204) (← links)
- A new approach for active automata learning based on apartness (Q6535565) (← links)
- Generic partition refinement and weighted tree automata (Q6535955) (← links)
- Supported sets -- a new foundation for nominal sets and automata (Q6610643) (← links)
- Action codes (Q6638147) (← links)
- Bisimilar states in uncertain structures (Q6643057) (← links)
