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 5 of 5 for “"Automatentheorie"”.

  1. Strategien in unendlichen Spielen mit Liveness-Gewinnbedingungen : Syntheseverfahren, Optimierung und Implementierung

    In this thesis we develop methods for the solution of infinite games and present implementations of corresponding algorithms in the framework of a platform for the experimental study of automata theoretic algorithms. Our focus is on games with winning conditions that express certain liveness …

    aachen Repository record for Strategien in unendlichen Spielen mit Liveness-Gewinnbedingungen : Syntheseverfahren, Optimierung und Implementierung (opens in a new tab)

  2. To and Fro Between Tableaus and Automata for Description Logics

    Beschreibungslogiken (Description logics, DLs) sind eine Klasse von Wissensrepraesentationsformalismen mit wohldefinierter, logik-basierter Semantik und entscheidbaren Schlussfolgerungsproblemen, wie z.B. dem Erfuellbarkeitsproblem. Zwei wichtige Entscheidungsverfahren fuer das …

    qucosa-diss

  3. Logic and games on automatic structures

    The evaluation of a logical formula can be viewed as a game played by two opponents, one trying to show that the formula is true and the other trying to prove it false. This correspondence is exploited algorithmically to evaluate formulas of first and second-order logic on finite structures. We …

    aachen Repository record for Logic and games on automatic structures (opens in a new tab)

  4. A log-linear discriminative modeling framework for speech recognition

    Conventional speech recognition systems are based on Gaussian hidden Markov models (HMMs).Discriminative techniques such as log-linear modeling have been investigated in speech recognition only recently. This thesis establishes a log-linear modeling framework in the context of discriminative …

    aachen Repository record for A log-linear discriminative modeling framework for speech recognition (opens in a new tab)

  5. Finite automata on unranked trees : extensions by arithmetical and equality constraints

    The notion of unranked trees has attracted much interest in current research, especially due to their application as formal models of XML documents. In particular, several automata and logic formalisms on unranked trees have been considered (again) in the literature, and many results that had …

    aachen Repository record for Finite automata on unranked trees : extensions by arithmetical and equality constraints (opens in a new tab)