Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Niwinski, Damian - Instytut Informatyki, Uniwersytet Warszawski
Symposium on Theoretical Aspects of Computer Science year (city), pp. numbers www.stacs-conf.org
Fundamenta Informaticae 98 (2010) 113 1 DOI 10.3233/FI-2010-136
On the topological complexity of tree languages Andre Arnold1
Higher-order pushdown trees are easy Teodor Knapik 1 , Damian Niwiski 2? , and Pawe Urzyczyn 2??
Continuous separation of game languages Andr Arnold
1 Introduction 1 2 Distributive Functions 2
Relating hierarchies of word and tree automata (extended abstract)
Deciding monadic theories of hyperalgebraic trees Teodor Knapik 1 , Damian Niwiski 2? , and Pawe Urzyczyn 2??
On the positional determinacy of edge{labeled Thomas Colcombet 1 Damian Niwi nski 1;2
-Calculus via Games (Extended Abstract)
WoLLIC 2004 Preliminary Version Deciding Nondeterministic Hierarchy of
Unsafe grammars and panic automata Teodor Knapik 1 , Damian Niwiski 2 ,
Fixed point characterization of infinite behavior of finite state systems
