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

  1. Cellular Automata Rules for Quantum-Dot Cellular Automata

    … the idea of devices that operate like cellular automata. Operation of cellular automata is based on local interactions; devices based on this paradigm would have much simpler interconnect requirements than conventional devices. One particular device of this type which has been investigated in …

    boise Repository record for Cellular Automata Rules for Quantum-Dot Cellular Automata (opens in a new tab)

  2. Stationary Automata

    In this dissertation, we investigate new automata, we call it stationary automata or ST-automata. This concept is based on the definition of TF-automaton by Wojciechowski [Woj2]. What is new in our approach is that we incorporate stationary subsets of limit ordinals of uncountable cofinality. The …

    wvu Repository record for Stationary Automata (opens in a new tab)

  3. Automata groups

    … is devoted to the groups generated by automata. The first part of the dissertation deals with L-presentations for such groups. We describe the sufficient condition for an essentially free automaton group to have an L-presentation. We also find the L-presentation for several other groups …

    tamu Repository record for Automata groups (opens in a new tab)

  4. Asynchronous cellular automata

    … investigate floating-point asynchronous cellular automata models implemented on Field-Programmable Gate Array (FPGA). It includes single grid and random schedules for individual cells. Cellular automata (CA) are basic representations of calculations that show interesting elaborate responses.

    csusb Repository record for Asynchronous cellular automata (opens in a new tab)

  5. Asynchronous cellular automata

    … investigate floating-point asynchronous cellular automata models implemented on Field-Programmable Gate Array (FPGA). It includes single grid and random schedules for individual cells. Cellular automata (CA) are basic representations of calculations that show interesting elaborate responses.

    csusb-retro Repository record for Asynchronous cellular automata (opens in a new tab)

  6. Weighted Branching Automata

    Eine der stärksten Erweiterungen der klassischen Theorie formaler Sprachen und Automaten ist die Einbeziehung von Gewichten oder Vielfachheiten aus einem Halbring. Diese Dissertation untersucht gewichtete Automaten über Strukturen mit Nebenläufigkeit. Wir erweitern die Arbeit von Lodaya und Weil …

    qucosa-diss

  7. Structure of automata

    Thesis (Ph. D.)--Michigan State University of Agriculture and Applied Science. Department of Mathematics, 1960

    msu Repository record for Structure of automata (opens in a new tab)

  8. Aesthetic Automata: Synthesis and Simulation of Aesthetic Behaviour in Cellular Automata

    … framework of multistate two-dimensional cellular automata (2D CA). The measure of complexity is a core concept in computational approaches to aesthetics. Shannon's information theory provided an objective measure of complexity, which led to the emergence of various informational theories of …

    goldsmiths Repository record for Aesthetic Automata: Synthesis and Simulation of Aesthetic Behaviour in Cellular Automata (opens in a new tab) Download PDF for Aesthetic Automata: Synthesis and Simulation of Aesthetic Behaviour in Cellular Automata (opens in a new tab)

  9. Underlying structures in automata

    … concept in the theory of computers known as automata. Of primary consideration are the concepts: homomorphism, and the reduction of automata.</p><p>Chapter I introduces some of the algebraic properties of semigroups and some special types of equivalence relations.</p><p>In Chapter II a …

    ut-knoxville Repository record for Underlying structures in automata (opens in a new tab)

  10. Automata and Ratio Sets

    This thesis explores the composition of ratio sets, the subsets of the rationals derived from the quotients of two sets of natural numbers, and examines a variety of specific examples where the comprising sets of natural numbers have specific properties. I present a general algorithm that decides …

    waterloo Repository record for Automata and Ratio Sets (opens in a new tab)

  11. Automata-Based Quantitative Verification

    … the quantitative system(s) using techniques from automata or graphs; and a numerical phase, which reasons about the quantitative dimension/cost model using numerical methods. The techniques used in both phases are so unlike each other that they are difficult to combine, forcing the phases to be …

    rice Repository record for Automata-Based Quantitative Verification (opens in a new tab)

  12. Branch groups and automata

    … gives a complete classification of ternary automata with $C_2$-action at the root, and a partial classification of ternary automata with $C_3$-action at the root. The concept of a `windmill automaton' is introduced in this chapter, and a complete classification of binary windmill automata is …

    oxford Repository record for Branch groups and automata (opens in a new tab)

  13. Probabilistic Automata with Parameters

    oxford Restricted access

  14. 3D Neural Cellular Automata

    Táto bakalárska práca predstavuje modulárny framework pre 3D neurálne celulárne automaty implementovaný v Pythone a PyTorch. Riešenie pozostáva zo samostatného jadra so simuláciou a tréningovou pipeline, z TCP servera sprístupňujúceho tréning vzdialenému klientovi a z doplnku do Blenderu pre …

    brno-tech Repository record for 3D Neural Cellular Automata (opens in a new tab)

  15. Automata, Representations, And Proofs

    In this dissertation, we study automata, languages, and functions between automata which preserve the language accepted. We examine them from the perspectives of representation theory, category theory, and proof theory. A central theme is that these perspectives interact in many useful, interesting …

    cornell Repository record for Automata, Representations, And Proofs (opens in a new tab)

  16. Developmental graph cellular automata

    … objects such as neural networks. Cellular Automata (CA) can be used to explore the capabilities of distributed computation. CA consist of a number of discrete cells connected in some configuration, each with a state and implementing the same update rule, which is applied in parallel at each …

    whiterose Download PDF for Developmental graph cellular automata (opens in a new tab)

  17. Automata on Cayley Graphs

    Two fundamental properties of the ordinary doubly infinite tape of a Turing machine are hidden behind the contents of the symbols written on it. An observer standing on a blank tape will be unable to distinguish one cell from another on the sole basis of their local appearance or relative position: …

    uiuc Repository record for Automata on Cayley Graphs (opens in a new tab)

  18. Algebraic Decomposition of Automata

    Made available in DSpace on 2014-12-11T18:24:00Z (GMT). No. of bitstreams: 1 7405516.pdf: 2074033 bytes, checksum: 31933cef7084628a3b4ddc0a7e86c8ae (MD5) Previous issue date: 1973

    uiuc Repository record for Algebraic Decomposition of Automata (opens in a new tab)

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

Page 1 of 75