{"paper":{"title":"Beyond $\\omega$BS-regular Languages: $\\omega$T-regular Expressions and Counter-Check Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Angelo Montanari (Universit\\`a di Udine, Dario Della Monica (Universidad Complutense de Madrid, Italy), Pietro Sala (Universit\\`a di Verona), Spain, Universit\\`a \"Federico II\" di Napoli","submitted_at":"2017-09-07T06:59:14Z","abstract_excerpt":"In the last years, various extensions of {\\omega}-regular languages have been proposed in the literature, including {\\omega}B-regular ({\\omega}-regular languages extended with boundedness), {\\omega}S-regular ({\\omega}-regular languages extended with strict unboundedness), and {\\omega}BS-regular languages (the combination of {\\omega}B- and {\\omega}S-regular ones). While the first two classes satisfy a generalized closure property, namely, the complement of an {\\omega}B-regular (resp., {\\omega}S-regular) language is an {\\omega}S-regular (resp., {\\omega}B-regular) one, the last class is not close"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02104","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}