NDLTD logo NDLTD Union Catalog and Global ETD Search

Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Entscheidbarkeit"”.

  1. Algorithmische Eigenschaften von Branching-Time Logiken

    Bauer, SebastianTechnische Universität Dresden

    … über verzweigenden Strukturen gezeigt. Entscheidbarkeitsresultate folgen für diverse Fragmente dieser Logiken. Anwendungen werden diskutiert.

    qucosa-diss

  2. The Forbidden Pattern Approach to Concatenation Hierarchies

    Schmitz, HeinzUniversität Würzburg

    The thesis looks at the question asking for the computability of the dot-depth of star-free regular languages. Here one has to determine for a given star-free regular language the minimal number of alternations between concatenation on one hand, and intersection, union, complement on the other …

    wurz-thes Repository record

  3. Forbidden-Patterns and Word Extensions for Concatenation Hierarchies

    Glaßer, ChristianUniversität Würzburg

    Starfree regular languages can be build up from alphabet letters by using only Boolean operations and concatenation. The complexity of these languages can be measured with the so-called dot-depth. This measure leads to concatenation hierarchies like the dot-depth hierarchy (DDH) and the closely …

    wurz-thes Repository record