NDLTD logo NDLTD Union Catalog and Global ETD Search

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 32 for “"finite automata"”.

  1. Partially Ordered Classes of Finite Automata

    Nievergelt, JurgUniversity of Illinois at Urbana-Champaign2014

    Made available in DSpace on 2014-12-09T22:17:26Z (GMT). No. of bitstreams: 1 6604255.pdf: 1696645 bytes, checksum: f4c830bf319eea31ac8d7e1893122fa7 (MD5) Previous issue date: 1965

    uiuc Repository record

  2. Generalized Decomposition of Incomplete Finite Automata

    Pu, Arthur Ta-ShiangUniversity of Illinois at Urbana-Champaign2014

    Made available in DSpace on 2014-12-09T22:17:29Z (GMT). No. of bitstreams: 1 6607791.pdf: 2865165 bytes, checksum: 137fe9810051b7b76d7e669c6a999f19 (MD5) Previous issue date: 1966

    uiuc Repository record

  3. On the Structure and Automorphisms of Finite Automata

    Bavel, ZamirUniversity of Illinois at Urbana-Champaign2014

    Made available in DSpace on 2014-12-09T22:17:24Z (GMT). No. of bitstreams: 1 6604137.pdf: 2978525 bytes, checksum: 33be782eae316f93d8170b5d97efc8c0 (MD5) Previous issue date: 1965

    uiuc Repository record

  4. Algorithms and lower bounds in finite automata size complexity

    Kapoutsis, Christos, 1974-Massachusetts Institute of Technology2006

    … the relative succinctness of several types of finite automata, focusing mainly on the following four basic models: one-way deterministic (1)FAs), one-way nondeterministic (1NFAs), two-way deterministic (2DFAS), and two-way nondeterministic (2NFAS). First, we establish the exact values of the …

    mit Repository record

  5. Finite-State Genericity : on the Diagonalization Strength of Finite Automata

    Busse, EdgarUniversität Heidelberg

    … der Theorie der Formalen Sprachen: Wir f¨uhren finite-state-Generizit¨atskonzepte ein und verwenden diese, um die Diagonalisierungsst¨arke endlicher Automaten zu erforschen. Wir konzentrieren uns hierbei auf die beschr¨ankte finite-state-Generizit¨at und Spezialf ¨alle hiervon, die wir durch die …

    heid-diss Repository record

  6. The transformational implementation of JSD process specifications via finite automata representation

    Bass, Andrew P.Aston University1992

    … with reference to formal language theory and automata theory. In particular, it is noted that Jackson structure diagrams are equivalent to regular expressions and can be thought of as specifying corresponding finite automata. The thesis discusses the automatic transformation of structure …

    aston Repository record

  7. On the power of nondeterminism in small two-way finite automata

    Kapoutsis, Christos, 1974-Massachusetts Institute of Technology2004

    … the conjecture that one-way nondeterministic finite automata (NFAS) can be exponentially more succinct than two-way deterministic ones (2DFAS); equivalently, that no polynomial-size sequence of 2DFAs can recognize B, for B a particular sequence of regular languages that is among the hardest of …

    mit Repository record

  8. On the sets of real vectors recognized by finite automata in multiple bases

    Brusten, JulienULiège - Université de Liège2011

    This thesis studies the properties of finite automata recognizing sets of real vectors encoded in positional notation using an integer base. We consider both general infinite-word automata, and the restricted class of weak deterministic automata, used, in particular, as symbolic data structures for …

    liege Repository record

  9. Exploring Computational Models: Analysis, Extensions, and Novel Approaches in Automata Theory

    Sayor, S M Sadman Sakib2026

    … of classical computational models, including finite automata, pushdown automata, and Turing machines. Motivated by the trade-off between expressive power and structural simplicity, it introduces a novel model called Counter-Based Finite Automata (CBFA). The proposed model extends deterministic …

    debrecen Repository record

  10. Expressiveness and Decidability of Weighted Automata and Weighted Logics

    Paul, ErikUniversität Leipzig

    Automata theory, one of the main branches of theoretical computer science, established its roots in the middle of the 20th century. One of its most fundamental concepts is that of a finite automaton, a basic yet powerful model of computation. In essence, finite automata provide a method to finitely …

    qucosa-diss

  11. Human and artificial intelligence acquisition of quantifiers

    Zhou, Samson SMassachusetts Institute of Technology2011

    … the minimal number of states in its determinate finite automata representation in polynomial time.

    mit Repository record

  12. A technique for converting NFA's and DFA's to regular expressions in Lex

    Safko, Gregory2016

    … can be employed to create lex rules from the Finite Automata.</p>

    rowan Repository record

  13. A model-based approach to automated test generation and error localization for Simulink/Stateflow

    Li, Meng2013

    … to a formal model, called Input/Output Extended Finite Automata (I/O-EFA), that is amenable to formal analysis such as test generation. The approach automatically identifies a set of input-output sequences to activate all executable computations in the Simulink/Stateflow diagram by applying three …

    iastate Repository record

  14. Epigenetic modelling: DNA methylation and working towards model parameterisation

    Porwal, JyotiDublin City University2011

    … and upgrade data. We present a Deterministic Finite Automata (DFA) model for the DNA methylation mechanism controlled by DNA methyltransferase (DNMT) enzymes. This thesis provides a brief introduction to epigenetics, a survey of ongoing research on computational epigenetics and a description …

    dcu Repository record

  15. Modelling temporal patterns using soft computing techniques. Application to the analysis of human body movements

    Bailador del Pozo, GonzaloInformatica2011

    … determine the class of a given signal. • Fuzzy Finite Automata approach. The pattern is considered as a sequence of events which are modelled by an automaton. Afterwards, this automaton is used to detect patterns in a given signal. The performance of our proposed techniques has been tested on …

    upm Repository record

  16. Two new approaches for learning Hidden Markov Models

    Kim, Hyun Soo, M. Eng. Massachusetts Institute of TechnologyMassachusetts Institute of Technology2010

    … algorithm that efficiently learns deterministic finite automata. The second insight follows from a careful analysis of the representation of HMMs as matrices and realizing that matrices hold deeper meaning than simply entities used to represent the HMMs. This thesis takes Angluin's approach and …

    mit Repository record

  17. State Estimation of Timed Discrete Event Systems and Its Applications

    GAO, CHAOUniversità degli Studi di Cagliari2023

    … DES endowed with a single clock, namely timed finite automata (TFA) and generalized timed finite automata (GTFA). In addition, a timing function is defined to associate each transition with a time interval specifying at which clock values it may occur. While the clock of a TFA is reset to zero …

    cagliari Repository record

  18. Comparative Mining of Multiple Web Data Source Contents with Object Oriented Model

    Alahmad, YanalUniversity of Windsor2013

    … automatic Non-Deterministic and Deterministic Finite Automata (NFA and DFA) for generating web site object schemas and content extraction, which contain similar data objects. Experimental results show that our system is effective and able to extract and mine structured data tuples from …

    windsor Repository record

  19. Transitive Closure Logic and Multihead Automata with Nested Pebbles

    Hirvonen, MinnaHelsingin yliopisto2020

    … fragments can be studied in terms of multihead finite automata. The type of automaton that we consider in this thesis is a two-way multihead automaton with nested pebbles. We look at the expressive power of multihead automata and the k-ary fragments of transitive closure logics in the class of …

    helsinki Repository record

  20. Forbidden-Patterns and Word Extensions for Concatenation Hierarchies

    Glaßer, ChristianUniversität Würzburg

    … these levels in terms of patterns in finite automata (subgraphs in the transition graph) that are not allowed. Therefore, such characterizations are called forbidden-pattern characterizations. The main results of the thesis are as follows: forbidden-pattern characterization for level …

    wurz-thes Repository record

Page 1 of 2