Sökning: "DFA"

Visar resultat 1 - 5 av 14 avhandlingar innehållade ordet DFA.

  1. 1. Design for assembly in the product development process : a design theory perspective

    Författare :Michael David Egan; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; design for manufacture; design for assembly; design methodology; DFA; DFM; product development; design process;

    Sammanfattning : .... LÄS MER

  3. 2. Incremental Learning and Testing of Reactive Systems

    Författare :Muddassar Sindhu; Karl Meinke; Bengt Jonsson; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Incremental learning; software testing; specification based testing; reactive systems; model checking; Computer science; Datalogi;

    Sammanfattning : This thesis concerns the design, implementation and evaluation of a specification based testing architecture for reactive systems using the paradigm of learning-based testing. As part of this work we have designed, verified and implemented new incremental learning algorithms for DFA and Kripke structures. LÄS MER

  4. 3. Theoretical prediction of properties of atomistic systems : Density functional theory and machine learning

    Författare :Alexander Lindmaa; Rickard Armiento; Igor Abrikosov; Torbjörn Björkman; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : The prediction of ground state properties of atomistic systems is of vital importance in technological advances as well as in the physical sciences. Fundamentally, these predictions are based on a quantum-mechanical description of many-electron systems. LÄS MER

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

  7. 5. Learning of Timed Systems

    Författare :Olga Grinchtein; Bengt Jonsson; Oded Maler; Uppsala universitet; []
    Nyckelord :learning regular languages; timed systems; event-recording automata;

    Sammanfattning : Regular inference is a research direction in machine learning. The goal of regular inference is to construct a representation of a regular language in the form of deterministic finite automaton (DFA) based on the set of positive and negative examples. LÄS MER