Search for dissertations about: "Automata Minimization"

Found 2 swedish dissertations containing the words Automata Minimization.

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

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

    Abstract : 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. READ MORE

  4. 2. Verification of Parameterized and Timed Systems : Undecidability Results and Efficient Methods

    Author : Johann Deneux; Parosh Abdulla; Eugene Asarin; Uppsala universitet; []
    Keywords : Parameterized Systems; Timed Systems; Symbolic Model Checking; Forward Reachability; Acceleration; Robust Languages; Language Universality; Automata Minimization; Bisimulation;

    Abstract : Software is finding its way into an increasing range of devices (phones, medical equipment, cars...). READ MORE