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 15 of 15 for “"finite state automata"”.
-
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 …
-
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, …
-
Bipolar fuzzy sets in switchboard automata and optimisation problems
… in a reliability system of an automobile. In automata theory, the decomposition theorem for bipolar fuzzy finite state automata and its transformations semigroups are initiated and discussed in order to enrich the structure of algebraic properties in bipolar fuzzy finite state automata. …
-
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 …
-
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 …
-
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 …
-
Modelos Markovianos para sistemas dinâmicos empregando aprendizado de máquina e teoria de autômatos
… de Estados Finitos (PFSA, Probabilistic Finite State Automata), comumente empregado em algoritmos de controle e técnicas de detecção de falha. Este trabalho apresenta um novo algoritmo para determinar um PFSA associado a um sistema dinâmico a partir de uma realização suficientemente longa …
-
Transducer dynamics
Transducers are finite state automata with an output. In this thesis, we attempt to classify sequences that can be constructed by iteratively applying a transducer to a given word. We begin exploring this problem by considering sequences of words that can be produced by iterative application of a …
-
Supporting interactive system testing with interaction sequences
… sequences and modelling of these sequences using Finite State Automata (FSA). We introduce the self-containment property and show how this is used to control the size and state space of FSA. We demonstrate simulating interaction sequences and discuss how these models can be applied within both …
-
Formalizing languages for service oriented computing
… systems of services are related to the design of finite state automata and process algebra concurrent systems, respectively. Furthermore, we introduce a formal language for dealing with choreography. Such a language is equipped with a formal semantics and it forms, together with a subset of the …
-
Development of a Supervisory Control System as a Transition Technology Towards Autonomous Reactor Plant Operations
… transition to fully autonomous reactor control. Finite state automata (FSA) provide a framework for engineering fully verifiable and validatable supervisory controllers, and thereby facilitate the transformation to autonomous operations in nuclear power plant operations. FSA serve as a …
-
INVESTIGATIONS ON COGNITIVE COMPUTATION AND COMPUTATIONAL COGNITION
… artificial agents, based on probabilistic finite state automata, is presented: in this model, agents have personalities and attitudes that can change through the course of interaction (e.g. by reinforcement learning) to achieve autonomous adaptation to the interaction partner. Markov chain …
-
Discrete event system modeling using SysML and model transformation
… subset if the system can be modeled using finite state machines or finite state automata. Furthermore, the system modeled by the proposed subset can avoid the state explosion problem, i.e., the number of the system states grows exponentially when the number of the components increases. We …
-
Morfologický analyzátor pomocí konečných automatů
Cílem tohoto textu je čtenáři co nejvíc přiblížit problematiku morfologie a morfologické analýzy slovenského jazyka s využitím morfologického analyzátoru a nastínit odlišnost od různých světových jazyků. Text také objasňuje význam hledání základního tvaru slov při analýze slovenských textů. V další …
-
Análisis, diseño y aplicación de modelos de diálogo flexibles, contextuales y dinámicos basados en redes bayesianas
… alternative to the classical dialogue systems (finite state automata or FSMs, script based systems or dialogue plans, . . . etc.), we have explored new dialogue approaches that allow greater flexibility and naturalness by appropriately defining dialogue as the interaction with an inference …