A non-regular language of infinite trees that is recognizable by a finite algebra

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Mikołaj Bojańczyk, Bartek Klin

Journal title: Logical Methods in Computer Science

Journal publisher: arxiv

Published year: 2018

DOI identifier: 10.23638/lmcs-15(4:11)2019