Weak Mso with the Unbounding Quantifier
| dc.creator | Bojanczyk, Mikolaj | |
| dc.date | 2009-02-06 | |
| dc.date.accessioned | 2026-07-07T12:49:48Z | |
| dc.date.available | 2026-07-07T12:49:48Z | |
| dc.description | A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of $ω$-regular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter automaton), and in terms of logic (weak monadic second-order logic with a bounding quantifier). Effective translations between the logic and automata are given. | |
| dc.identifier | https://arxiv.org/abs/0902.1042 | |
| dc.identifier | http://arxiv.org/abs/0902.1042 | |
| dc.identifier | 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (2009) 159-170 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/222497 | |
| dc.subject | Formal Languages and Automata Theory | |
| dc.subject | Logic in Computer Science | |
| dc.title | Weak Mso with the Unbounding Quantifier | |
| dc.type | text |