Search for dissertations about: "finite automata"
Showing result 1 - 5 of 38 swedish dissertations containing the words finite automata.
-
1. Reduction Techniques for Finite (Tree) Automata
Abstract : Finite automata appear in almost every branch of computer science, for example in model checking, in natural language processing and in database theory. In many applications where finite automata occur, it is highly desirable to deal with automata that are as small as possible, in order to save memory as well as excecution time. READ MORE
-
2. Formal Languages and Automata in Computational Algebra
Abstract : This thesis is a collection of six papers in computational algebra. In particular, we study noncommutative Gröb- ner bases, SAGBI bases and similar algebraic objects which can be represented as a graph or an automaton. READ MORE
-
3. On Supervisor Synthesis via Active Automata Learning
Abstract : Our society's reliance on computer-controlled systems is rapidly growing. Such systems are found in various devices, ranging from simple light switches to safety-critical systems like autonomous vehicles. In the context of safety-critical systems, safety and correctness are of utmost importance. READ MORE
-
4. A Seamless Framework for Control Function Generation
Abstract : As we progress in time, the dependence and inseparability of our daily lives to computer and software systems grow rapidly; some transparent to many of us. It is therefore crucial to have efficient design of correct and well-functioning computer and software systems. READ MORE
-
5. A novel approach to text classification
Abstract : This thesis explores the foundations of text classification, using both empirical and deductive methods, with a focus on author identification and syntactic methods. We strive for a thorough theoretical understanding of what affects the effectiveness of classification in general. READ MORE