Sökning: "Finite automata"

Visar resultat 1 - 5 av 38 avhandlingar innehållade orden Finite 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. Formal Languages and Automata in Computational Algebra

    Författare :Jonas Månsson; Algebra; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; control; Datalogi; Talteori; algebraisk geometri; algebra; gruppteori; Computer science; numerical analysis; systems; group theory; field theory; algebraic geometry; finite automata; Number Theory; Gröbner bases; SAGBI bases; numerisk analys; system; kontroll; fältteori;

    Sammanfattning : This thesis is a collection of six papers in computational algebra. In particular, we study noncommutative Gröb- ner bases, SAGBI bases and similar algebraic objects which can be represented as a graph or an automaton. LÄS MER

  4. 3. On Supervisor Synthesis via Active Automata Learning

    Författare :Ashfaq Hussain Farooqui; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Supervisory control theory; Finite-state machines; Active learning; Model learning; Automata learning; Discrete-event systems;

    Sammanfattning : Our society's reliance on computer-controlled systems is rapidly growing. Such systems are found in various devices, ranging from simple light switches to safety-critical systems like autonomous vehicles. In the context of safety-critical systems, safety and correctness are of utmost importance. LÄS MER

  5. 4. A Seamless Framework for Control Function Generation

    Författare :Sajed Miremadi; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Discrete Event Systems; Supervisory Control Theory; Deterministic Finite Automata; Binary Decision Diagrams; Extended Finite Automata;

    Sammanfattning : As we progress in time, the dependence and inseparability of our daily lives to computer and software systems grow rapidly; some transparent to many of us. It is therefore crucial to have efficient design of correct and well-functioning computer and software 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