Sökning: "Deterministic Finite Automata"

Visar resultat 1 - 5 av 9 avhandlingar innehållade orden Deterministic 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. 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

  4. 3. 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

  5. 4. Optimal Coordination of Flexible Manufacturing Systems, with Automatic Generation of Collision- and Dealock-Free Working Schedule

    Författare :Avenir Kobetski; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Visibility Graphs; Scheduling; A*; Mixed Integer Linear Programming; Discrete Event Systems; Velocity Balancing.; Robot Coordination; Supervisory Control Theory; Deterministic Finite Automata; Flexible Manufacturing;

    Sammanfattning : The ever more rapidly changing markets pose high demands on the modern industry, often making it necessary to have varied and frequently updated product portfolios. As a consequence, modern industrial systems need to be easily adaptable to different kinds of products, which makes the use of flexible manufacturing systems (FMS) increasingly popular. LÄS MER

  7. 5. Optimization of Manufacturing Cells Using Discrete Event Models

    Författare :Avenir Kobetski; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Flexible Manufacturing; Optimal Scheduling; Supervisory Control Theory; A*; Velocity Balancing; Discrete Events Systems; Mixed Integer Linear Programming; Timed Deterministic Finite Automata; Robot Coordination; Visibility Graphs;

    Sammanfattning : As the name suggests, this thesis is concerned with flexible manufacturing systems (FMS) and their way of living. More specifically, the main objective of this workis to generate working schedules for the moving objects of the manufacturing cells. LÄS MER