Sökning: "tree automata"

Visar resultat 1 - 5 av 9 avhandlingar innehållade orden tree automata.

  1. 1. Reduction Techniques for Finite (Tree) Automata

    Författare :Lisa Kaati; Parosh Aziz Abdulla; Frank Drewes; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Finite automata; tree automata; bisimulation; minimization; simulation; composed bisimulation; composed simulation; Datavetenskap; Computer Science;

    Sammanfattning : Finite automata appear in almost every branch of computer science, for example in model checking, in natural language processing and in database theory. In many applications where finite automata occur, it is highly desirable to deal with automata that are as small as possible, in order to save memory as well as excecution time. LÄS MER

  3. 2. Inlined Reference Monitors : Certification,Concurrency and Tree Based Monitoring

    Författare :Andreas Lundblad; Mads Dam; Gul Agha; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Runtime monitoring; policy enforcement; tree automata; monitor inlining; certification; concurrency;

    Sammanfattning : Reference monitor inlining is a technique for enforcing security policies by injecting security checks into the untrusted software in a style similar to aspect-oriented programming. The intention is that the injected code enforces compliance with the policy (security), without adding behavior (conservativity) or affecting existing policy compliant behavior (transparency). LÄS MER

  4. 3. Contributions to the theory and applications of tree languages

    Författare :Johanna Högberg; Frank Drewes; Manfred Droste; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; regular tree languages; tree series; algorithmic learning; MAT-learning; bisimulation minimisation; tree-based generation; algorithmic composition; music algebra; Computer science; Datalogi;

    Sammanfattning : This thesis is concerned with theoretical as well as practical aspects of tree languages. It consists of an introduction and eight papers, organised into three parts. LÄS MER

  5. 4. Complexity and expressiveness for formal structures in Natural Language Processing

    Författare :Petter Ericson; Henrik Björklund; Frank Drewes; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; graph grammars; formal languages; natural language processing; parameterized complexity; abstract meaning representation; tree automata; deterministic tree-walking transducers; mildly context-sensitive languages; hyperedge replacement; tree adjoining languages; minimally adequate teacher;

    Sammanfattning : The formalized and algorithmic study of human language within the field of Natural Language Processing (NLP) has motivated much theoretical work in the related field of formal languages, in particular the subfields of grammar and automata theory. Motivated and informed by NLP, the papers in this thesis explore the connections between expressibility – that is, the ability for a formal system to define complex sets of objects – and algorithmic complexity – that is, the varying amount of effort required to analyse and utilise such systems. LÄS MER

  7. 5. A novel approach to text classification

    Författare :Niklas Zechner; Johanna Björklund; Efstathios Stamatatos; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Text classification; natural language processing; automata; Computer Science; datalogi;

    Sammanfattning : This thesis explores the foundations of text classification, using both empirical and deductive methods, with a focus on author identification and syntactic methods. We strive for a thorough theoretical understanding of what affects the effectiveness of classification in general. LÄS MER