Sökning: "decidability"

Hittade 4 uppsatser innehållade ordet decidability.

  1. 1. Language Theoretic Properties of Graph Extension Languages : An Investigation of Graph Extension Grammars with Context Matching and Logic

    Master-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Yannick Stade; [2022]
    Nyckelord :graph language; formal language; theoretical computer science;

    Sammanfattning : Graph extension grammars provide a way to define graph languages. They consist of a regular tree grammar and an algebra. The regular tree grammar generates trees, so-called derivation trees. Those are evaluated by the algebra into a set of graphs. LÄS MER

  3. 2. Formalizing Constructive Quantifier Elimination in Agda

    Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknik

    Författare :Jeremy Pope; [2018-04-04]
    Nyckelord :Agda; decidability; semantics; successor; constructive;

    Sammanfattning : In this thesis a constructive formalization of quantifier elimination is presented, based on a classical formalization by Tobias Nipkow [16]. The formalization is implemented and verified in the programming language/proof assistant Agda [1]. LÄS MER

  4. 3. λ-Calculus and Decidability

    Kandidat-uppsats, Uppsala universitet/Algebra och geometri

    Författare :Erik Larsson; [2017]
    Nyckelord :;

    Sammanfattning : .... LÄS MER

  5. 4. DAG Automata - Variants, Languages and Properties

    Master-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Johannes Blum; [2015]
    Nyckelord :;

    Sammanfattning : We study final-state automata that work on directed acyclic graphs (DAGs). We consider ordered and unordered DAGs and show that they can be simulated by each other. Then we show that deterministic DAG automata are weaker then nondeterministic automata. LÄS MER