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 350 for “"automata"”.
-
Asynchronous logic automata
… In particular, we introduce "asynchronous logic automata", which are a specialization of both asynchronous cellular automata and Petri nets, and include Boolean logic primitives in each cell. We also show some example algorithms, means to create circuits, potential hardware implementations, and …
-
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 …
-
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: …
-
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
-
Cellular Automata: Algorithms and Applications
Cellular automata (CA) are an interesting computation medium to study because of their simplicity and inherently parallel operation. These characteristics make them a useful and efficient computation tool for applications such as cryptography and physical systems modelling, particularly when …
-
Synthesis of stochastic learning automata.
… developed in the field of stochastic learning automata theory and, consequently, the application areas for learning systems. In control engineering, they are viewed as a means to implement optimal adaptive controllers for situations where little or no a priori information on the plant is …
-
Circuit design for logic automata
The Logic Automata model is a universal distributed computing structure which pushes parallelism to the bit-level extreme. This new model drastically differs from conventional computer architectures in that it exposes, rather than hides, the physics underlying the computation by accommodating data …
-
Structural Design Using Cellular Automata
… the application of massively scalable cellular automata (CA) techniques to structural design. There are two sets of CA rules, one used to propagate stresses and strains, and one to perform design analysis. These rules can be applied serially, periodically, or concurrently, and Jacobi or …
-
A ZF6HP26 automata sebességváltó áttételének meghatározása
A dolgozat célja a ZF6HP26 automata sebességváltó áttételének a meghatározása, ehhez elsőnek a konstrukcióból adódó összetett bolygóműegység vizsgálatát kell elvégezni. Számos tanulmány, cikk foglalkozik a Ravigneaux- bolygómű áttételével, egyenleteivel, szabadtest ábra készítésével, viszont a …
-
Theory and application of learning automata.
… the theoretical performance of many learning automata has been considered, the practical operation of these automata has received far less attention. This work starts with the construction of two action Tsetlin and Krylov automata. The performance of these automata has been measured in …
-
An automata-based automatic verification environment
… of the algorithm for translating LTL into Buchi automata. The original translation algorithm is presented in Gerth et al and is the basis of model checkers such as SPIN. We also provide a formal proof of the termination and correctness of this algorithm. All definitions and proofs have been done …
-
Predicate Calculus for Perception-led Automata
Artificial Intelligence is a fuzzy concept. My role, as I see it, is to put down a working definition, a criterion, and a set of assumptions to set up equations for a workable methodology. This research introduces the notion of Artificial Intelligent Agency, denoting the application of Artificial …
-
Partially Ordered Classes of Finite Automata
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
-
Generalized Decomposition of Incomplete Finite Automata
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
-
On the Realization of Linear Automata
Made available in DSpace on 2014-12-08T22:24:44Z (GMT). No. of bitstreams: 1 7001016.pdf: 3069177 bytes, checksum: fa1a3e5d14c576e96fc6d6575a3ac530 (MD5) Previous issue date: 1969
-
Simulation of composite I/O automata
… at MIT. This tool simulates the execution of automata described by the IOA language. It generates logs of execution traces and provides other pertinent information regarding the execution, such as the validity of specified invariants. Although the simulator supports paired simulation of two …
-
Cellular automata methods in mathematical physics
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Physics, 1994.
-
Matrix multiplication with Asynchronous Logic Automata
… type of architecture, Asynchronous Logic Automata, which I conclude has the potential to be easy to program in a parametric way and execute very dense, high-throughput computation at a lesser energy cost than that of today's supercomputers. This architecture aligns physics and computation …
Page 1 of 18