List of publications:

  • 2011

  1. M. Bojańczyk, B. Klin, S. Lasota, Automata with group actions, LICS 2011.
  2. W Czerwiński, P Hofman, S Lasota, Decidability of branching bisimulation on normed commutative context-free processes, CONCUR 2011.
  3. J. Duparc, A. Facchini, F. Murlak, Definable Operations On Weakly Recognizable Sets of Trees, FSTTCS 2011.


  • 2012
  1. A. Arnold, H. Michalewski, D. Niwiński, On the separation question for tree languages, STACS 2012.
  2. M. Bojańczyk, L. Braud, B. Klin, S. Lasota, Towards nominal computation, POPL 2012.
  3. P. Parys, A Pumping Lemma for Pushdown Graphs of Any Level, STACS 2012.
  4. S. Hummel, M. Skrzypczak, The Topological Complexity of MSO+U and Related Automata Models, Fundamenta Informaticae 2012.
  5. H. Michalewski, D. Niwiński, On topological completeness of regular tree languages, Logic and Program Semantics 2012: 165-179.
  6. P. Parys, On the Significance of the Collapse Operation, LICS 2012.
  7. A. Kartzow, P. Parys, Strictness of the Collapsible Pushdown Hierarchy, MFCS 2012.
  8. M. Bojańczyk, E. Kopczyński, Sz. Toruńczyk, Ramsey’s theorem for colors from a metric space, Semigroup Forum, 2012.
  9. P. Parys, Variants of Collapsible Pushdown Systems, CSL 2012.
  10. W. Czerwiński, P. Hofman, S. Lasota, Reachability problem for weak multi-pushdown automata, CONCUR 2012.
  11. A. Dawar, E. Graedel, B. Holm, E. Kopczynski, W. Pakusa, Definability of linear equation systems over groups and rings, CSL 2012.
  12. S. Hummel, Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones, GandALF 2012. 
  13. P. Parys, Higher-Order Pushdown Systems with Data, GandALF 2012.
  14. M. Bojańczyk, S. Lasota, An extension of data automata that captures XPath, Logical Methods in Computer Science 8 (1:5), 2012.


  • 2013
  1. M. Bojańczyk, Sz. Toruńczyk, Weak MSO+U over infinite trees, STACS 2013.
  2. U. Boker, O. Kupferman, D. Kuperberg, M. Skrzypczak, Nondeterminism in the Presence of a Diverse or Unknown Future, ICALP 2013.
  3. M. Bojańczyk, B. Klin, S. Lasota, Sz. Toruńczyk, Turing machines with atoms, LICS 2013.
  4. A. Facchini, F. Murlak, M. Skrzypczak, Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata, LICS 2013.
  5. A. Dawar, E. Graedel, B. Holm, E. Kopczynski, W. Pakusa, Definability of linear equation systems over groups and rings, Logical Methods in Computer Science 9 (4:12), 2013.
  6. A. Arnold, H. Michalewski, D. Niwiński, On the separation question for tree languages, Theory of Computing Systems ..., 2013.
  7. P. Hofman, S. Lasota, R. Mayr, P. Totzke. Simulation Over One-counter Nets is PSPACE-Complete, FSTTCS 2013.


  • 2014
  1. C. David, P. Hofman, F. Murlak,  M. Pilipczuk, Transformation Synthesis from XML Schema Mappings, ICDT 2014.
  2. W. Czerwiński, P. Hofman, S. Lasota,Decidability of bisimulation on normed commutative context-free processes with silent moves. Theory of Computing Systems 55(1):136-169, 2014.
  3. M. Bojańczyk, B. Klin, S. Lasota, Automata theory in nominal sets. Logical Methods in Computer Science ...
  4. D. Figueira, P. Hofman, S. Lasota, Relating timed and register automata. Mathematical Structures in Computer Science ...
  5. E. Kopczyński, D. Niwiński, A simple indeterminate infinite game. In Logic, Computation, Hierarchies, ed. by Brattka, Vasco and Diener, Hannes and Spreen, Dieter.