@InProceedings{zetzsche_LIPIcs.FSTTCS.2025.2,
author = {Zetzsche, Georg},
title = {{Unboundedness Problems for Formal Languages}},
booktitle = {45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2025)},
pages = {2:1--2:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
isbn = {978-3-95977-406-2},
issn = {1868-8969},
year = {2025},
volume = {360},
editor = {Aiswarya, C. and Mehta, Ruta and Roy, Subhajit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.2},
urn = {urn:nbn:de:0030-drops-250810},
doi = {10.4230/lipics.fsttcs.2025.2},
annote = {Keywords: Decidability, formal languages, unifying frameworks, downward closure, separability},
date-added = {2025-12-12 13:41:45 +0100}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A