Separability by piecewise testable languages and downward closures beyond subwords

DOI10.1145/3209108.3209201zbMath1497.68281OpenAlexW2810848820MaRDI QIDQ5145372

Georg Zetzsche

Publication date: 20 January 2021

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3209108.3209201

zbMATH Keywords

separabilitypiecewise testable languageswell-quasi-orderingsdownward closures

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics of partially ordered sets (06A07) Logic in computer science (03B70)

Related Items (2)

Existential Definability over the Subword Ordering ⋮ Unnamed Item

This page was built for publication: Separability by piecewise testable languages and downward closures beyond subwords