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 84 for “"Automata Theory"”.

  1. Quantum Cellular Automata: Theory and Applications

    This thesis presents a model of Quantum Cellular Automata (QCA). The presented formalism is a natural quantization of the classical Cellular Automata (CA). It is based on a lattice of qudits, and an update rule consisting of local unitary operators that commute with their own lattice translations. …

    waterloo Repository record for Quantum Cellular Automata: Theory and Applications (opens in a new tab)

  2. Quantum cellular automata: Theory and applications

    This thesis presents a model of Quantum Cellular Automata (QCA). The presented formalism is a natural quantization of the classical Cellular Automata (CA). It is based on a lattice of qudits, and an update rule consisting of local unitary operators that commute with their own lattice translations. …

    kent

  3. Automata Theory Used to Detect Plagiarism

    {Bakalářská práce se zabývá hledáním a rozpoznáváním plagiátorství v programovacím jazyce C++. Jaké metody existují, které jsou nejefektivnější a zároveň ukazuje slabiny těchto metod. Samotný program je naprogramován v C++, s využitím nástroje Clang pro generaci abstraktních syntaktických stromů. …

    brno-tech Repository record for Automata Theory Used to Detect Plagiarism (opens in a new tab)

  4. Proving Properties of Fibonacci Representations via Automata Theory

    … of Fibonacci-based representations via automata theory. We call a representation (or a number system) complete and unambiguous when it provides one and only one representation for each number in the range covered by the representation. Many commonly used representations are complete and …

    waterloo Repository record for Proving Properties of Fibonacci Representations via Automata Theory (opens in a new tab)

  5. Using Automata Theory to Solve Problems in Additive Number Theory

    Additive number theory is the study of the additive properties of integers. Perhaps the best-known theorem is Lagrange’s result that every natural number is the sum of four squares. We study numbers whose base-k representations have certain interesting proper- ties. In particular, we look at …

    waterloo Repository record for Using Automata Theory to Solve Problems in Additive Number Theory (opens in a new tab)

  6. Applications of automata theory to presentations of monoids and inverse monoids

    There is a strong connection between monoids, automata and languages. The traditional approach is to exploit properties of the syntactic monoid of an automaton to derive characteristics of the language recognized by the automaton. In this work we construct certain automata and exploit the …

    nebraska Repository record for Applications of automata theory to presentations of monoids and inverse monoids (opens in a new tab)

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

  8. Perceptions of teaching and learning automata theory in a college-level computer science course

    … contribute to effective teaching and learning of Automata Theory in a competitive college−level Computer Science program. Effective teaching is the ability to create an appropriate learning environment in order to provide effective learning. We define effective learning as the ability of a student …

    texas Repository record for Perceptions of teaching and learning automata theory in a college-level computer science course (opens in a new tab)

  9. Pioneering network shape intelligence for protein-protein interaction prediction via Cannistraci-Hebb network automata theory

    … displayed by any topological network automata to perform valid connectivity predictions without training, but only processing the input knowledge associated to the local topological network organization. NSI transcends conventional link prediction methods by weaving together principles …

    qucosa-diss

  10. ΣΧΕΔΙΑΣΜΟΣ ΣΥΣΤΗΜΑΤΩΝ VLSI ΓΙΑ ΤΗΝ ΕΠΕΞΕΡΓΑΣΙΑ ΑΠΕΙΚΟΝΙΣΜΕΝΩΝ ΔΕΔΟΜΕΝΩΝ

    … SUMMARIZED AS FOLLOWS: A) RESEARCH IN CELLULAR AUTOMATA THEORY AND THE APPLICATION OF THE RESULTS OF THIS RESEARCH IN THE FIELD OF PICTORIAL DATA CLASSIFICATION. ADDITIONALLY, THREE PARALLEL ARCHITECTURES WHERE IMPLEMENTED IN THE VLSI FOR THE EFFICIENT EXECUTION OF THE PROPOSED ALGORITHMS. B) …

    greece Repository record for ΣΧΕΔΙΑΣΜΟΣ ΣΥΣΤΗΜΑΤΩΝ VLSI ΓΙΑ ΤΗΝ ΕΠΕΞΕΡΓΑΣΙΑ ΑΠΕΙΚΟΝΙΣΜΕΝΩΝ ΔΕΔΟΜΕΝΩΝ (opens in a new tab)

  11. Counting, Adding, and Regular Languages

    … two mostly disjoint topics in formal language theory that both involve the study and use of regular languages. The first topic lies in the intersection of automata theory and additive number theory. We introduce a method of producing results in additive number theory, relying on theorem-proving …

    waterloo Repository record for Counting, Adding, and Regular Languages (opens in a new tab)

  12. Angluin learning : a modal logic approach

    … by investigating the intersections between automata theory, the theory of coalgebras, and modal logic. We begin by presenting the L?algorithm together with foundational notions of automata theory, coalgebra and modal logic. We then reformulate this algorithm within a coalgebraic setting, …

    strathclyde Repository record for Angluin learning : a modal logic approach (opens in a new tab)

  13. State transformers and modes of computation

    … a generalization of the transition functions of automata. The 2-categorical properties of subequalizers are developed and related to adjunctions in a 2-category. A calculus of monads in a 2-category is presented, and general lifting theorems are proved. Applications to constructions in …

    uiuc Repository record for State transformers and modes of computation (opens in a new tab)

  14. Cellular Automata for Structural Optimization on Recongfigurable Computers

    … analysis and optimization techniques. Cellular automata theory provides a method to model these problems in a format conducive to representation on a reconfigurable computer. The calculations do not need to be executed with high precision and can be performed in parallel. By implementing …

    vt Repository record for Cellular Automata for Structural Optimization on Recongfigurable Computers (opens in a new tab)

  15. Formal specification of the TCP service and verification of TCP connection management

    … the approach of Coloured Petri nets (CPNs) and automata theory, this thesis shows how to formalise the service provided by the Transmission Control Protocol (TCP) and verify TCP Connection Management, an essential part of TCP. Most of the previous work on modelling and analysing TCP Connection …

    adelaide Repository record for Formal specification of the TCP service and verification of TCP connection management (opens in a new tab)

  16. An Algebraic Perspective on Game Theory

    Even though the fields of game theory and algebra are well-established, limited literature analyzes games using modern algebraic theories. In 2009, Rhodes published a game complexity study titled \textit{Complexity of Games} via \textit{Applications of Automata Theory and Algebra}, which uses …

    waterloo Repository record for An Algebraic Perspective on Game Theory (opens in a new tab)

  17. On labeled paths

    Labeled graph theory is the marriage of two common problem domains to computer science -- graph theory and automata theory. Though each has been independently studied in depth, there has been little investigation of their intersection, the labeled paths. This dissertation examines three results in …

    alabama Repository record for On labeled paths (opens in a new tab)

Page 1 of 5