Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 20 for “"Sequential machine theory"”.

  1. Structure of events and automata

    Thesis (Ph. D.)--Michigan State University. Department of Electrical Engineering, 1968

    msu Repository record for Structure of events and automata (opens in a new tab)

  2. Conflict Resolution and Optimization of Multiple-Satellite Systems (CROMSAT)

    This thesis produces models of satellite constellations using finite state automata (FSA) or finite automata (FA) and optimizes the sequence of targets for two missions. Two simplified FSA models of satellite constellations with one ground control station (GCS) are developed. The first model is of …

    nps Repository record for Conflict Resolution and Optimization of Multiple-Satellite Systems (CROMSAT) (opens in a new tab)

  3. Structural realizations of program schemata

    Thesis (Ph. D.)--Michigan State University. Department of Computer Science, 1971

    msu Repository record for Structural realizations of program schemata (opens in a new tab)

  4. A Finite State Machine Synthesizer

    This thesis presents a Finite State Machine (FSM) Synthesizer developed at Portland State University. The synthesizer starts from a high level behavioral description, in which no states are specified, and generates the lower level FSM descriptions for simulation and physical layout generation.

    portland-state Repository record for A Finite State Machine Synthesizer (opens in a new tab)

  5. A new approach to state minimization of finite state machines

    … to ease the task of large scale Finite State Machine (FSM) minimization presented in this thesis: TDFM (Two Dimensional FSM Minimizer), is a part of the DIADES system. DIADES is an Automatic Design Synthesis System whose development in the Department of Electrical Engineering at Portland State …

    portland-state Repository record for A new approach to state minimization of finite state machines (opens in a new tab)

  6. Application of two complementary sequencing rules to control the job shop by switching

    This research presents two switching techniques using SOT and SLACK, as complementary sequencing rules, to show that they are practical procedures to control a job shop. These two approaches are: Static switching of the complementary rules. Dynamic switching of the complementary rules. This study …

    vt Repository record for Application of two complementary sequencing rules to control the job shop by switching (opens in a new tab)

  7. Explaining dual-task implicit learning deficits: the effect of within stimulus presentation

    Under typical between stimulus dual-task conditions, implicit sequence learning typically suffers, except under within stimulus conditions, where the stimuli for both tasks are the same. This finding is inconclusive, given that it has not been replicated and the study under which it was obtained …

    gatech Repository record for Explaining dual-task implicit learning deficits: the effect of within stimulus presentation (opens in a new tab)

  8. Investigation of Sequential Machine Design Techniques for Implementation of a TRAC Scanning Algorithm

    … algorithm is the major degrading factor. A TRAC machine consisting of a hardwired pre-processor to scan the input and produce formatted data for a stack oriented evaluator is proposed. The control machine for the input scanning algorithm for the pre-processor is designed using various sequential …

    ucf Repository record for Investigation of Sequential Machine Design Techniques for Implementation of a TRAC Scanning Algorithm (opens in a new tab)

  9. Larger-first partial parsing

    Larger-first partial parsing is a primarily top-down approach to partial parsing that is opposite to current easy-first, or primarily bottom-up, strategies. A rich partial tree structure is captured by an algorithm that assigns a hierarchy of structural tags to each of the input tokens in a …

    ucf Repository record for Larger-first partial parsing (opens in a new tab)

  10. Behaviour-based classification of encryption-type ransomware using system calls

    … thesis presents solutions using Finite State Machines (FSM) and supervisor reduction to quickly detect Android encryption-type ransomware. Furthermore, the solutions are evaluated on Linux encryption-type ransomware to show its transferability and generalisability. We measured the success of …

    waikato-masters Repository record for Behaviour-based classification of encryption-type ransomware using system calls (opens in a new tab) Download file for Behaviour-based classification of encryption-type ransomware using system calls (opens in a new tab)

  11. Maximality and Applications of Subword-Closed Languages

    … ⊆ S⊗ is an important problem in formal language theory with applications to coding theory and DNA codewords. Given a finite set of words of a fixed length S, the constraint, we consider its subword closure, S⊗, the set of words whose subwords of that fixed length are all in the constraint. We …

    unf Repository record for Maximality and Applications of Subword-Closed Languages (opens in a new tab) Download PDF for Maximality and Applications of Subword-Closed Languages (opens in a new tab)