Caterpillar Dualities and Regular Languages

DOI10.1137/120879270zbMath1286.68215arXiv1203.1347OpenAlexW3100883497MaRDI QIDQ2870506

Claude Tardif, Gábor Tardos, Péter L. Erdős

Publication date: 21 January 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.1347

zbMATH Keywords

regular languagesconstraint satisfaction problemscaterpillar duality

Mathematics Subject Classification ID

Trees (05C05) Logic in computer science (03B70) Descriptive complexity and finite models (68Q19)

Related Items (1)

On infinite-finite duality pairs of directed graphs

This page was built for publication: Caterpillar Dualities and Regular Languages