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 22 for “"Automata theory"”.
-
Two undecidability results in probabilistic automata theory
Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1985.
-
The complexity of decision problems in automata theory and logic.
Massachusetts Institute of Technology. Dept. of Electrical Engineering. Thesis. 1974. Ph.D.
-
Exploring Computational Models: Analysis, Extensions, and Novel Approaches in Automata Theory
… 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 finite …
-
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 …
-
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 …
-
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 …
-
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 …
-
The transformational implementation of JSD process specifications via finite automata representation
… characterised 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 …
-
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. …
-
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 …
-
Algebraic study of fuzzy finite switchboard automata
… systems. The classical version of the algebraic automata is a part of theoretical computer science which is not effectively reflecting the practical demands of the computation at the algebraic level. It unable to formalize the controller to predict the flow of the next input information into a …
-
Noncommutative rational functions and their finite-dimensional representations
… mathematics, such as noncom-mutative algebra, automata theory, control theory, free analysis, free real algebraic geometry and free probability. A noncommutative rational function is given by a formal rational expression involving freely noncommuting variables and arithmetic operations, which …
-
Weighted Logics and Weighted Simple Automata for Context-Free Languages of Infinite Words
… between monadic second-order logic and finite automata for both finite and infinite words. This BET- Theorem has been extended by Lautemann, Schwentick and Thérien to context-free languages by introducing a monadic second-order logic with an additional existentially quantified second-order …
-
Improved Symbolic Model Checking of Real-Time Systems
… and have been applied to encode closed timed automata and Stateful Timed CSP modeling languages. With regard to model checking algorithms, interesting problems are reachability analysis and emptiness checking. In the second part of the thesis, we aim to improve the current state-of-the-art …
-
Extremal Combinatorics and Universal Algorithms
… problems in different areas of mathematics: automata theory, combinatorics of partially ordered sets and extremal combinatorics. Firstly, we focus on some new automata that do not seem to have occurred much in the literature, that of solvability of mazes. For our model, a maze is a countable …
-
Algebraic relaxations and hardness results in polynomial optimization and Lyapunov analysis
… labeled directed graph. Inspired by concepts in automata theory and symbolic dynamics, we define a class of graphs called path-complete graphs, and show that any such graph gives rise to a method for proving stability of switched systems. The semidefinite programs arising from this technique …
-
Abstract Transducers for Software Analysis and Verification
Whenever software faults can endanger human life, property, or the environment, the absence of faults must be ensured with utmost care and the best technologies available. Evidence is needed showing that all requirements are satisfied and that the risk of faults is reduced. One technique to conduct …
-
Expressiveness and Decidability of Weighted Automata and Weighted Logics
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 …
-
The Finite Embeddability Property for Some Noncommutative Knotted Varieties of RL and DRL
… a general setting for studying ideals in ring theory, were later shown to form algebraic models for substructural logics. The latter are non-classical logics that include intuitionistic, relevance, many-valued, and linear logic, among others. Most of the important examples of substructural …
-
Verification of linear-time properties for finite probabilistic systems
… of this thesis is a new translation of LTL to automata that are provably smaller than previously known ones. This translation helps us in reducing the asymptotic complexity of qualitative model checking of MDPs against certain fragments of LTL. We implement this translation in a tool called …
Page 1 of 2