We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
We define a new class of languages of ω-words, strictly extendingω-regular languages. One way to present this new class is by a type of regular expressions. Thenew expressions are an extension of ω-regular expressions where two newvariants of the Kleene star L∗ are added: LB and LS. These newexponents are used to say that parts of the input word have bounded size, andthat parts of the input can have arbitrarily large sizes, respectively. Forinstance, the expression (aBb)ω represents the language of infinitewords over the letters a,b where there is a common bound on the number ofconsecutive letters a. The expression (aSb)ω represents a similarlanguage, but this time the distance between consecutive b's is required totend toward the infinite. We develop a theory for these languages, with a focus on decidability andclosure. We define an equivalent automaton model, extending B\"uchi automata.The main technical result is a complementation lemma that works for languageswhere only one type of exponent---either LB or LS---is used. We use the closure and decidability results to obtain partial decidabilityresults for the logic MSOLB, a logic obtained by extending monadic second-orderlogic with new quantifiers that speak about the size of sets
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.