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…