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

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.