Damian Niwinski

From MaRDI portal
Revision as of 13:37, 7 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Damian Niwinski to Damian Niwinski: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:607441

Available identifiers

zbMath Open niwinski.damianDBLPn/DamianNiwinskiWikidataQ102414111 ScholiaQ102414111MaRDI QIDQ607441

List of research outcomes





PublicationDate of PublicationType
On Guidable Index of Tree Automata2023-08-08Paper
200 Problems on Languages, Automata, and Computation2023-01-30Paper
Automata on infinite trees with counting constraints2022-11-02Paper
Daniel Simson Obituary2022-10-31Paper
Contribution of Warsaw logicians to computational logic2019-06-19Paper
The Ackermann Award 20132017-02-02Paper
https://portal.mardi4nfdi.de/entity/Q49823502015-04-09Paper
On the separation question for tree languages2015-02-05Paper
Preface2013-11-28Paper
The Ackermann Award 2012.2012-11-22Paper
https://portal.mardi4nfdi.de/entity/Q29047792012-08-23Paper
On Topological Completeness of Regular Tree Languages2012-07-16Paper
On the Borel Inseparability of Game Tree Languages2012-04-24Paper
Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal2012-01-18Paper
https://portal.mardi4nfdi.de/entity/Q30869172011-03-30Paper
Preface2011-01-03Paper
Choice functions and well-orderings over the infinite binary tree2010-11-22Paper
The Ackermann Award 20102010-09-03Paper
On the Borel Complexity of MSO Definable Sets of Branches2010-05-25Paper
The Ackermann Award 20072009-03-05Paper
https://portal.mardi4nfdi.de/entity/Q54451572008-03-03Paper
On the positional determinacy of edge-labeled games2006-03-24Paper
Automata, Languages and Programming2006-01-10Paper
https://portal.mardi4nfdi.de/entity/Q47382272004-08-11Paper
A gap property of deterministic tree languages.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q44118132003-07-10Paper
https://portal.mardi4nfdi.de/entity/Q27788252002-03-21Paper
Rudiments of \(\mu\)-calculus2001-03-18Paper
On Distributive Fixed-Point Expressions2000-03-16Paper
https://portal.mardi4nfdi.de/entity/Q49361262000-01-24Paper
https://portal.mardi4nfdi.de/entity/Q42665461999-10-03Paper
Fixed point characterization of infinite behavior of finite-state systems1998-06-30Paper
https://portal.mardi4nfdi.de/entity/Q43813911998-04-01Paper
y= 2xVS.y= 3x1997-09-28Paper
Games for the \(\mu\)-calculus1997-02-27Paper
On the feasibility of checking temporal integrity constraints1996-06-10Paper
Automata on infinite trees with counting constraints1996-04-16Paper
https://portal.mardi4nfdi.de/entity/Q42736641994-08-28Paper
THE EFFECT OF THE NUMBER OF SUCCESSFUL PATHS IN A BÜCHI TREE AUTOMATON1993-11-01Paper
https://portal.mardi4nfdi.de/entity/Q40352591993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q39899481992-06-28Paper
A geometrical view of the determinization and minimization of finite-state automata1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57535281990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30333181989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37300121986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47237061985-01-01Paper
Fixed-point characterization of context-free ∞-languages1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33268211983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39499851982-01-01Paper

Research outcomes over time

This page was built for person: Damian Niwinski