Mikolaj Bojanczyk, Bartek Klin. A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra. Logical Methods in Computer Science, 15(4), 2019. [doi]
@article{BojanczykK19,
title = {A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra},
author = {Mikolaj Bojanczyk and Bartek Klin},
year = {2019},
url = {https://lmcs.episciences.org/5927},
researchr = {https://researchr.org/publication/BojanczykK19},
cites = {0},
citedby = {0},
journal = {Logical Methods in Computer Science},
volume = {15},
number = {4},
}