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 71 for “"Finite State Automata"”.

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

  2. Pathway representation using finite state automata and comparison using the NCI thesaurus

    Can one classify biochemical pathways based on their topology? What is the topology of a biochemical pathway? What are the fundamental principles underlying different biochemical pathways involved in similar functional areas? Will one be able to characterize pathway "motifs" similar to motifs in …

    uvic Repository record for Pathway representation using finite state automata and comparison using the NCI thesaurus (opens in a new tab)

  3. Suitability of Finite State Automata to Model String Constraints in Probablistic Symbolic Execution

    … For string data types SE tools commonly utilize finite state automata to represent a symbolic string model. Thus, PSE inherits from SE automata-based symbolic string models to calculate the probabilities of string-based constraints describing program paths. However, to our knowledge, there is …

    boise Repository record for Suitability of Finite State Automata to Model String Constraints in Probablistic Symbolic Execution (opens in a new tab)

  4. QUANTUM AND TRANSLUCENT PARADIGMS IN AUTOMATA THEORY: A STUDY ON COMPUTATIONAL CAPABILITIES

    Within the realm of automata theory, various models differ on their processing mechanisms and computational paradigms. This study investigates two computational paradigms, recently introduced in the literature: quantum and translucency. Specifically, we investigate Quantum Finite State Automata …

    milano Repository record for QUANTUM AND TRANSLUCENT PARADIGMS IN AUTOMATA THEORY: A STUDY ON COMPUTATIONAL CAPABILITIES (opens in a new tab)

  5. Workflow Modeling Using Finite Automata

    … In this work, a formal framework based on finite state automata that facilitate modeling and analysis of workflows is presented. The workflow and its specifications are modeled separately as finite state automata models. We provide a general framework for specifying control flow …

    usf Repository record for Workflow Modeling Using Finite Automata (opens in a new tab)

  6. Weighted Automata with Storage

    In this thesis, we investigate weighted tree automata with storage theoretically. This model generalises finite state automata in three dimensions: (i) from words to trees, (ii) by using an arbitrary storage type in addition to a finite-state control, and (iii) by considering languages in a …

    qucosa-diss

  7. Intensional Cyberforensics

    … benefits and difficulties are compared with the finite-state-automata approach. This work extends the use of the intensional programming paradigm to the modeling and implementation of a cyberforensics investigation process with backtracing of event reconstruction, in which evidence is modeled by …

    concordia Download PDF for Intensional Cyberforensics (opens in a new tab)

  8. Synchronizing Automata and the Černý Conjecture

    … the Černý conjecture. This conjecture concerns finite-state automata that have the property of being "synchronizing." A synchronizing automaton is one for which there exists some input sequence that causes the automaton to transition to some fixed state, irrespective of the state in which it had …

    ecu Repository record for Synchronizing Automata and the Černý Conjecture (opens in a new tab)

  9. Flexible environments in dynamic lexical analysis systems

    … trees used to implement dynamic deterministic finite state automata (DDFA). These trees are built during IPL and loaded with command, synonym, and noiseword tokens, all of which are stored in separate VMS files. Synonym and noiseword translation is carried out in the lexical analysis process, …

    vt Repository record for Flexible environments in dynamic lexical analysis systems (opens in a new tab)

  10. Automata-Theoretic Synthesis of Plans and Reactive Strategies

    … languages, that can be transformed into finite state automata. Finite state automata are a central theme in the dissertation, and we use them as the computational normal form to derive theoretical results and algorithms. Another central theme is the use of FOND planners as a tool. FOND …

    toronto-retro Repository record for Automata-Theoretic Synthesis of Plans and Reactive Strategies (opens in a new tab)

  11. Towards parametric verification of the capability exchange signalling protocol

    … idea of exploiting structural regularities of state spaces to obtain symbolic representations of state spaces and their associated deterministic Finite State Automata (FSA) that represent service (or protocol) languages. This is an important step towards parametric verification of the CES …

    adelaide Repository record for Towards parametric verification of the capability exchange signalling protocol (opens in a new tab)

  12. Inducing Grammar from Sparse Data Sets

    … for identifying a regular language based on a finite set of example strings. There have been a number of different approaches proposed for grammar induction. Current state-of-the-art solutions leverage a depth-first search strategy, which is an evidence based state merging strategy or a …

    guelph Repository record for Inducing Grammar from Sparse Data Sets (opens in a new tab)

  13. Abstraction of symbolic execution for string analysis

    … a symbolic representation of the program state. Traditionally, applications of this technique have focused on symbolically representing only primitive data types, while more recent extensions have expanded to reference types. This thesis demonstrates the ability to symbolically execute the …

    texas Repository record for Abstraction of symbolic execution for string analysis (opens in a new tab) Restricted access

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

  15. Decoding algorithms using side-effect machines

    … Machines(SEMs) which are generalizations of finite state automata. Single Classifier Machines(SCMs) use a single side effect machine to classify all words within a code. Locking Side Effect Machines(LSEMs) use multiple side effect machines to create a tree structure of subclassification. The …

    brock Repository record for Decoding algorithms using side-effect machines (opens in a new tab)

  16. An Investigation of Feasible Logical Depth and Complexity Measures via Automata and Compression Algorithms

    … of such objects at lower complexity levels via finite-state automata, transducers and compression algorithms. We pay particular attention to normal sequences. One measurement which relies on Kolmogorov Complexity is Bennett’s Logical Depth, which has been described in the past as measuring how …

    maynooth Download PDF for An Investigation of Feasible Logical Depth and Complexity Measures via Automata and Compression Algorithms (opens in a new tab)

  17. Προβληματική της παροιμίας στη μετάφραση: η χρήση της στη νέα ελληνική και η ηλεκτρονική επεξεργασία της

    … forms of proverbs. The mathematical model of finite-state automata permits the precise pre representation of proverbs. Proverbs provide an interesting look into Lodern Greek and French. As regards translation, proverbs have a cultural load which we must take under consideration in the …

    greece Repository record for Προβληματική της παροιμίας στη μετάφραση: η χρήση της στη νέα ελληνική και η ηλεκτρονική επεξεργασία της (opens in a new tab)

  18. Automated test sequence generation for finite state machines using genetic algorithms

    … implementations, formally specified using finite state automata (FSA) has been of interest. Such systems include communication protocols and control sections of safety critical systems. There is extensive literature regarding how to formally validate an FSM based specification, but testing …

    brunel Repository record for Automated test sequence generation for finite state machines using genetic algorithms (opens in a new tab)

  19. Power Signal Analysis of Channel Current Signal Using HMM-EM and Time Domain FSA

    … required. The levels are then identified using Finite State Automata (FSAs). Spike Detector algorithm analyzes spikes characterizing behavior of molecule in pore. No commercial tools available are capable of analyzing spikes in presence of noise. The formulation of HMM-EM, FSAs and Spike …

    uno Repository record for Power Signal Analysis of Channel Current Signal Using HMM-EM and Time Domain FSA (opens in a new tab)

  20. An intuitive and flexible architecture for intelligent mobile robots

    … deliberative planning, reactive control, finite state automata, behaviour trees and uses competition for behaviour selection. This behaviour selection is based on a task manager, which selects behaviours based on approximations of their applicability to the current situation and the …

    manitoba Repository record for An intuitive and flexible architecture for intelligent mobile robots (opens in a new tab)

Page 1 of 4