Seguir
Damian Niwinski
Damian Niwinski
Professor of Computer Science, University of Warsaw
Dirección de correo verificada de mimuw.edu.pl - Página principal
Título
Citado por
Citado por
Año
Rudiments of calculus
A Arnold, D Niwinski
Elsevier, 2001
4002001
Higher-order pushdown trees are easy
T Knapik, D Niwiński, P Urzyczyn
Foundations of Software Science and Computation Structures: 5th …, 2002
2362002
On fixed-point clones
D Niwiński
International Colloquium on Automata, Languages, and Programming, 464-473, 1986
1781986
Games for the μ-calculus
D Niwiński, I Walukiewicz
Theoretical Computer Science 163 (1-2), 99-116, 1996
1631996
Fixed points vs. infinite generation
D Niwinski
Proceedings Third Annual Symposium on Logic in Computer Science, 402,403,404 …, 1988
1141988
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 Niwiński
Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles …, 1993
881993
Fixed point characterization of weak monadic logic definable sets of trees
A Arnold, D Niwinski
Tree automata and Languages 10, 159-188, 1992
781992
Relating hierarchies of word and tree automata
D Niwiński, I Walukiewicz
STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science …, 1998
761998
Unsafe grammars and panic automata
T Knapik, D Niwiński, P Urzyczyn, I Walukiewicz
Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005
742005
A gap property of deterministic tree languages
D Niwiński, I Walukiewicz
Theoretical Computer Science 303 (1), 215-231, 2003
712003
Deciding monadic theories of hyperalgebraic trees
T Knapik, D Niwiński, P Urzyczyn
International Conference on Typed Lambda Calculi and Applications, 253-267, 2001
622001
First-order queries over temporal databases inexpressible in temporal logic
D Toman, D Niwiński
International Conference on Extending Database Technology, 305-324, 1996
501996
Deciding nondeterministic hierarchy of deterministic tree automata
D Niwiński, I Walukiewicz
Electronic Notes in Theoretical Computer Science 123, 195-208, 2005
482005
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
391991
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
382010
On the positional determinacy of edge-labeled games
T Colcombet, D Niwiński
Theoretical Computer Science 352 (1-3), 190-196, 2006
372006
Continuous separation of game languages
A Arnold, D Niwiński
Fundamenta Informaticae 81 (1-3), 19-28, 2007
342007
Equational μ-calculus
D Niwiński
Symposium on Computation Theory, 169-176, 1984
32*1984
The Horn mu-calculus
W Charatonik, D McAllester, D Niwinski, A Podelski, I Walukiewicz
Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science …, 1998
271998
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20