Damian Niwinski
Damian Niwinski
Professor of Computer Science, University of Warsaw
Verified email at mimuw.edu.pl - Homepage
Title
Cited by
Cited by
Year
Rudiments of calculus
A Arnold, D Niwinski
Elsevier, 2001
3762001
Higher-order pushdown trees are easy
T Knapik, D Niwiński, P Urzyczyn
International Conference on Foundations of Software Science and Computation …, 2002
2232002
On fixed-point clones
D Niwiński
International Colloquium on Automata, Languages, and Programming, 464-473, 1986
1591986
Games for the μ-calculus
D Niwiński, I Walukiewicz
Theoretical Computer Science 163 (1-2), 99-116, 1996
1151996
Fixed points vs. infinite generation
D Niwinski
Proceedings Third Annual Symposium on Logic in Computer Science, 402,403,404 …, 1988
1071988
Fixed point characterization of infinite behavior of finite-state systems
D Niwiński
Theoretical Computer Science 189 (1-2), 1-69, 1997
941997
On the feasibility of checking temporal integrity constraints
J Chomicki, D Niwinski
Journal of Computer and System Sciences 51 (3), 523-535, 1995
831995
Fixed point characterization of weak monadic logic definable sets of trees
A Arnold, D Niwinski
Tree automata and Languages 10, 159-188, 1992
721992
Unsafe grammars and panic automata
T Knapik, D Niwiński, P Urzyczyn, I Walukiewicz
International Colloquium on Automata, Languages, and Programming, 1450-1461, 2005
692005
A gap property of deterministic tree languages
D Niwiński, I Walukiewicz
Theoretical Computer Science 303 (1), 215-231, 2003
642003
Relating hierarchies of word and tree automata
D Niwiński, I Walukiewicz
Annual Symposium on Theoretical Aspects of Computer Science, 320-331, 1998
641998
Deciding monadic theories of hyperalgebraic trees
T Knapik, D Niwiński, P Urzyczyn
International Conference on Typed Lambda Calculi and Applications, 253-267, 2001
582001
First-order queries over temporal databases inexpressible in temporal logic
D Toman, D Niwiński
International Conference on Extending Database Technology, 305-324, 1996
471996
Deciding nondeterministic hierarchy of deterministic tree automata
D Niwiński, I Walukiewicz
Electronic Notes in Theoretical Computer Science 123, 195-208, 2005
452005
Choice functions and well-orderings over the infinite binary tree
A Carayol, C Löding, D Niwinski, I Walukiewicz
Open Mathematics 8 (4), 662-682, 2010
362010
Fixed point characterization of Buchi automata on infinite trees
A Arnold, D Niwinski
Journal of Information Processing and Cybernetics 26 (8-9), 451-459, 1991
361991
Equational μ-calculus
D Niwiński
Symposium on Computation Theory, 169-176, 1984
311984
Continuous separation of game languages
A Arnold, D Niwiński
Fundamenta Informaticae 81 (1-3), 19-28, 2007
292007
On the positional determinacy of edge-labeled games
T Colcombet, D Niwiński
Theoretical Computer Science 352 (1-3), 190-196, 2006
232006
On the topological complexity of tree languages.
A Arnold, J Duparc, F Murlak, D Niwinski
Logic and automata 2, 2008
222008
The system can't perform the operation now. Try again later.
Articles 1–20