8,939 research outputs found

    Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages

    Get PDF
    The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability) were previously not known. We develop new forbidden-chain characterizations for the single levels of these hierarchies and obtain the following results: - The classes of the Boolean hierarchy over level Σ1\Sigma_1 of the dot-depth hierarchy are decidable in NLNL (previously only the decidability was known). The same remains true if predicates mod dd for fixed dd are allowed. - If modular predicates for arbitrary dd are allowed, then the classes of the Boolean hierarchy over level Σ1\Sigma_1 are decidable. - For the restricted case of a two-letter alphabet, the classes of the Boolean hierarchy over level Σ2\Sigma_2 of the Straubing-Th\'erien hierarchy are decidable in NLNL. This is the first decidability result for this hierarchy. - The membership problems for all mentioned Boolean-hierarchy classes are logspace many-one hard for NLNL. - The membership problems for quasi-aperiodic languages and for dd-quasi-aperiodic languages are logspace many-one complete for PSPACEPSPACE

    Monadic Second-Order Logic with Arbitrary Monadic Predicates

    Full text link
    We study Monadic Second-Order Logic (MSO) over finite words, extended with (non-uniform arbitrary) monadic predicates. We show that it defines a class of languages that has algebraic, automata-theoretic and machine-independent characterizations. We consider the regularity question: given a language in this class, when is it regular? To answer this, we show a substitution property and the existence of a syntactical predicate. We give three applications. The first two are to give very simple proofs that the Straubing Conjecture holds for all fragments of MSO with monadic predicates, and that the Crane Beach Conjecture holds for MSO with monadic predicates. The third is to show that it is decidable whether a language defined by an MSO formula with morphic predicates is regular.Comment: Conference version: MFCS'14, Mathematical Foundations of Computer Science Journal version: ToCL'17, Transactions on Computational Logi

    In the Maze of Data Languages

    Full text link
    In data languages the positions of strings and trees carry a label from a finite alphabet and a data value from an infinite alphabet. Extensions of automata and logics over finite alphabets have been defined to recognize data languages, both in the string and tree cases. In this paper we describe and compare the complexity and expressiveness of such models to understand which ones are better candidates as regular models

    On Decidability Properties of Local Sentences

    Get PDF
    Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the finite and the infinite model theory of these sentences. We prove here several additional results on local sentences. The first one is a new decidability result in the case of local sentences whose function symbols are at most unary: one can decide, for every regular cardinal k whether a local sentence phi has a model of order type k. Secondly we show that this result can not be extended to the general case. Assuming the consistency of an inaccessible cardinal we prove that the set of local sentences having a model of order type omega_2 is not determined by the axiomatic system ZFC + GCH, where GCH is the generalized continuum hypothesi

    On Measuring Non-Recursive Trade-Offs

    Full text link
    We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their growth rate, and show how to deduce such bounds in general. We also identify criteria which, in the spirit of abstract language theory, allow us to deduce non-recursive tradeoffs from effective closure properties of language families on the one hand, and differences in the decidability status of basic decision problems on the other. We develop a qualitative classification of non-recursive trade-offs in order to obtain a better understanding of this very fundamental behaviour of descriptional systems
    • …
    corecore