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 806 for “"finite-state"”.

  1. 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)

  2. Finite-state quantum computational complexity

    The automatic complexity of finite words was introduced by Shallit and Wang (2001) as a computable and visual analogue to Kolmogorov complexity. It measures the complexity of a word $x$ as the minimum number of states of a finite automaton that uniquely accepts $x$. Here, an automaton $M$ uniquely …

    hawaii Repository record for Finite-state quantum computational complexity (opens in a new tab)

  3. A Finite State Machine CASE Tool

    Software systems specified in terms of states and events such as communication protocols, window applications, and various data processing algorithms, are easily implemented by Finite State Machines (FSMs). State transition graphs and tables are two common methods of graphically representing FSMs. …

    texas-state Repository record for A Finite State Machine CASE Tool (opens in a new tab)

  4. Capacity Analysis of Finite State Channels

    Channels with state model communication settings where the channel statistics are not fully known or vary over transmissions. It is important for a communication system to obtain the channel state information in terms of increasing channel capacity. This thesis addresses the effect of the quality …

    mcmaster Repository record for Capacity Analysis of Finite State Channels (opens in a new tab)

  5. A finite-state morphological analyzer for Q'eqchi' using Helsinki Finite-State Technology (HFST) and the Giellatekno infrastructure

    Finite-state morphological modeling has been used in natural language processing for many years particularly when dealing with lower resource languages. The present study details the development of an open-source finite-state morphological model for the Q'eqchi' Maya language using Helsinki …

    byu Repository record for A finite-state morphological analyzer for Q'eqchi' using Helsinki Finite-State Technology (HFST) and the Giellatekno infrastructure (opens in a new tab) Download PDF for A finite-state morphological analyzer for Q'eqchi' using Helsinki Finite-State Technology (HFST) and the Giellatekno infrastructure (opens in a new tab)

  6. Forgetting properties of finite-state reciprocal processes

    … chains (RC) are a class of discrete-index, finite-state stochastic process having the non-causal generalisation of the Markov property, where rather than the future being conditionally independent of the past given the present, intervals are conditionally independent of their complement …

    adelaide Repository record for Forgetting properties of finite-state reciprocal processes (opens in a new tab)

  7. Finite state properties of bounded parthwidth graphs

    … structure by a string or tree of symbols over a finite alphabet (termed a parse of the structure), and (2) finite-state recognition of these representations. The project reported on here explores several issues regarding this approach to al­gorithm design that must be adequately resolved in order …

    uvic Repository record for Finite state properties of bounded parthwidth graphs (opens in a new tab)

  8. State minimization problems in finite state automata

    In this thesis, we analyze the problem of state minimization in 2-MDFAs. The class of 2-MDFAs is an extension of the class of DFAs, allowing a small amount of nondeterminism; specifically two start states. Since nondeterminism allows finite automata to be more succinct, it is worthwhile to …

    wvu Repository record for State minimization problems in finite state automata (opens in a new tab)

  9. A correspondence principle for finite state dimension

    … in complexity theory. This work deals with finite-state dimension where the s-gale has to be computable using finite-state machines. The research problem addressed in this work is to determine sets of sequences in Cantor Space (i.e., sets of binary sequences for which the Hausdorff dimension …

    iastate Repository record for A correspondence principle for finite state dimension (opens in a new tab)

  10. Finite-state dimension of the Kolakoski sequence

    <p>Finite-state dimension is a computational version of classical Hausdorff (fractal) dimension that was recently developed by Dai, Lathrop, Lutz and Mayordomo. The finite-state dimension of an infinite binary sequence S is a real number dim[Subscriot FS](S) in [0,1] that characterizes the …

    iastate Repository record for Finite-state dimension of the Kolakoski sequence (opens in a new tab)

  11. Finite-state control of the hybrid telerobotic system

    … the hybrid system controller using the finite-state automata, and implements the theoretical findings into commercial program as part of the real-time application.</p>

    ut-knoxville Repository record for Finite-state control of the hybrid telerobotic system (opens in a new tab)

  12. Test set generation using linear finite state machines

    … test sets into se­quences generated by linear finite state machines. The performance of the machines is analyzed using simulation. An alternative approach using partitioning is also proposed. Our research shows that the embedding is possible. However, finding good machines is comparatively …

    uvic Repository record for Test set generation using linear finite state machines (opens in a new tab)

  13. On the design of finite-state type systems

    Practical computers have only finite amounts of memory. However, the programs that run on them are often written in languages that effectively assume (via providing constructs such as general recursion) that infinite memory is available, meaning that an implementation of those programs is …

    birmingham Download PDF for On the design of finite-state type systems (opens in a new tab)

  14. Improving Low-Resource Translation with Finite State Grammars

    … using morphological grammars created using finite state transducers. This study explores the benefits, historical background, and effectiveness of this approach. This study incorporates morphological tags into a pre-trained multilingual neural machine translation model using a dual encoder …

    cuny-grad Repository record for Improving Low-Resource Translation with Finite State Grammars (opens in a new tab)

  15. Language-based analysis of communicating finite state machines.

    … on detecting errors defined in terms of global states. A complementary approach is to analyze the process languages of a protocol, where a process language is defined as the set of executable event sequences of a process in the protocol. A general property of a process is "effectiveness", …

    ottawa-retro Repository record for Language-based analysis of communicating finite state machines. (opens in a new tab)

Page 1 of 41