The following pages link to Damian Niwinski (Q607441):
Displaying 50 items.
- (Q586517) (redirect page) (← links)
- Choice functions and well-orderings over the infinite binary tree (Q607442) (← links)
- (Q656585) (redirect page) (← links)
- Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal (Q656586) (← links)
- Games for the \(\mu\)-calculus (Q671352) (← links)
- On the positional determinacy of edge-labeled games (Q818128) (← links)
- Fixed point characterization of infinite behavior of finite-state systems (Q1389678) (← links)
- A gap property of deterministic tree languages. (Q1401364) (← links)
- Automata on infinite trees with counting constraints (Q1898484) (← links)
- On the feasibility of checking temporal integrity constraints (Q1908342) (← links)
- On the separation question for tree languages (Q2254515) (← links)
- Contribution of Warsaw logicians to computational logic (Q2422533) (← links)
- (Q2778825) (← links)
- On Topological Completeness of Regular Tree Languages (Q2897950) (← links)
- (Q2904779) (← links)
- The Ackermann Award 2013 (Q2958505) (← links)
- (Q3033318) (← links)
- (Q3086917) (← links)
- THE EFFECT OF THE NUMBER OF SUCCESSFUL PATHS IN A BÜCHI TREE AUTOMATON (Q3141779) (← links)
- A geometrical view of the determinization and minimization of finite-state automata (Q3210193) (← links)
- (Q3326821) (← links)
- On the Borel Complexity of MSO Definable Sets of Branches (Q3561217) (← links)
- The Ackermann Award 2010 (Q3586064) (← links)
- The Ackermann Award 2007 (Q3608440) (← links)
- Fixed-point characterization of context-free ∞-languages (Q3719854) (← links)
- (Q3730012) (← links)
- (Q3949985) (← links)
- (Q3989948) (← links)
- (Q4035259) (← links)
- (Q4266546) (← links)
- (Q4273664) (← links)
- <i>y</i>= 2<i>x</i>VS.<i>y</i>= 3<i>x</i> (Q4358061) (← links)
- (Q4381391) (← links)
- (Q4411813) (← links)
- The Ackermann Award 2012. (Q4649531) (← links)
- (Q4723706) (← links)
- (Q4738227) (← links)
- (Q4936126) (← links)
- On Distributive Fixed-Point Expressions (Q4943552) (← links)
- (Q4982350) (← links)
- Daniel Simson Obituary (Q5044394) (← links)
- Automata on infinite trees with counting constraints (Q5044742) (← links)
- On the Borel Inseparability of Game Tree Languages (Q5390008) (← links)
- (Q5445157) (← links)
- Automata, Languages and Programming (Q5716767) (← links)
- (Q5753528) (← links)
- 200 Problems on Languages, Automata, and Computation (Q5872503) (← links)
- Preface (Q5891348) (← links)
- Preface (Q5894010) (← links)
- Rudiments of \(\mu\)-calculus (Q5926539) (← links)
