2 citations · 3 across the 2 of their papers we have counts for
3 papers
cs.FL2017★ 2 cited
Some connections between universal algebra and logics for trees
Mikołaj Bojańczyk, Henryk Michalewski
One of the major open problems in automata and logic is the following: is there an algorithm which inputs a regular tree language and decides if the language can be defined in firs…
cs.LG2016
Learning from the memory of Atari 2600
Jakub Sygnowski, Henryk Michalewski
We train a number of neural networks to play games Bowling, Breakout and Seaquest using information stored in the memory of a video game console Atari 2600. We consider four models…
math.LO2009★ 1 cited
On the Borel Inseparability of Game Tree Languages
Szczepan Hummel, Henryk Michalewski, Damian Niwinski
The game tree languages can be viewed as an automata-theoretic counterpart of parity games on graphs. They witness the strictness of the index hierarchy of alternating tree automat…