Damian Niwinski
Damian Niwinski
Professor of Computer Science, University of Warsaw
Verifierad e-postadress på mimuw.edu.pl - Startsida
Titel
Citeras av
Citeras av
År
Rudiments of calculus
A Arnold, D Niwinski
Elsevier, 2001
3642001
Higher-order pushdown trees are easy
T Knapik, D Niwiński, P Urzyczyn
International Conference on Foundations of Software Science and Computation …, 2002
2132002
On fixed-point clones
D Niwiński
International Colloquium on Automata, Languages, and Programming, 464-473, 1986
1551986
Fixed points vs. infinite generation
D Niwinski
[1988] Proceedings. Third Annual Symposium on Logic in Computer Science, 402-409, 1988
1071988
Games for the μ-calculus
D Niwiński, I Walukiewicz
Theoretical Computer Science 163 (1-2), 99-116, 1996
981996
Fixed point characterization of infinite behavior of finite-state systems
D Niwiński
Theoretical Computer Science 189 (1-2), 1-69, 1997
911997
Automata: from logics to algorithms.
MY Vardi, T Wilke
Logic and automata 2, 629-736, 2008
77*2008
On the feasibility of checking temporal integrity constraints
J Chomicki, D Niwinski
Journal of Computer and System Sciences 51 (3), 523-535, 1995
771995
Fixed point characterization of weak monadic logic definable sets of trees
A Arnold, D Niwinski
Tree automata and Languages 10, 159-188, 1992
711992
Unsafe grammars and panic automata
T Knapik, D Niwiński, P Urzyczyn, I Walukiewicz
International Colloquium on Automata, Languages, and Programming, 1450-1461, 2005
682005
A gap property of deterministic tree languages
D Niwiński, I Walukiewicz
Theoretical Computer Science 303 (1), 215-231, 2003
632003
Deciding monadic theories of hyperalgebraic trees
T Knapik, D Niwiński, P Urzyczyn
International Conference on Typed Lambda Calculi and Applications, 253-267, 2001
562001
Relating hierarchies of word and tree automata
D Niwiński, I Walukiewicz
Annual Symposium on Theoretical Aspects of Computer Science, 320-331, 1998
521998
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
432005
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
331984
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
322010
Continuous separation of game languages
A Arnold, D Niwiński
Fundamenta Informaticae 81 (1-3), 19-28, 2007
282007
On the topological complexity of tree languages.
A Arnold, J Duparc, F Murlak, D Niwinski
Logic and automata 2, 2008
212008
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20