CS 15-859 Domain Theory
You can change your ad preferences anytime.
CS Domain Theory Bibliography
Upcoming SlideShare. Like this document? Why not share! Hard math for middle school imlem p Embed Size px. Start on. Show related SlideShares at end. WordPress Shortcode. Educationtempee Follow. Published in: Science. Book ed.
Share this page:
Academic Press, M. Springer, LNCS , This course will present two main basic aspects of algorithms in strings. The presented techniques can be useful in many applications including natural language processing, data compression and computational biology. More specifically the course deals with the following topics: main exact single string matching algorithms Morris-Pratt, Knuth-Morris-Pratt, Simon, Boyer-Moore Turbo-BM and Apostolico-Giancarlo algorithms ; main indexing structures and the algorithms for building them suffix trees, compact suffix trees, suffix automata, compact suffix automata, suffix arrays and enhanced suffix arrays.
Rupak Majumdar Kaiserslautern , introductory, 10 hours.
- Course Description?
- Opposites & Oddities;
- Management in Networks: On multi-actor decision making.
- Email and Ethics: Style and Ethical Relations in Computer-Mediated Communications (Routledge Studies in Contemporary Philosophy).
The last ten years have seen a lot of interesting tools that can automatically analyze properties of software implementations. In this series of lectures, we shall study the technical developments behind these tools. The lectures will cover the basic principles of symbolic model checking and abstraction, and show how ideas like predicate abstraction, counterexample-guided refinement, interpolation, and concolic execution can be used together to build sophisticated program analysis tools.
References: Ranjit Jhala and Rupak Majumdar. Software Model Checking.
Formal Models and Semantics, Volume B
ACM Computing Surveys, Besides the foundations in terms of classical automata theory, enough information will be provided to prepare for the lab-based tutorial session for providing a first tangible experience of the technology, its strength and its weaknesses, e. The lab-session will also introduce the LearnLib www.
Enhancements 2h lecture, 2h tutorial The focus here will be on totally application-independent enhancement concerning: the use of data structures, the efficient treatment of counter examples, the efficient realization of equivalence queries, other automata models e. Mealy machines, IO-Automata. Besides some technical aspects, like resetting and remote testing, this lecture will focus on abstraction, the central notion for bringing learning to practical use: on the one hand, automata learning is too expensive to apply directly to most realistic concrete systems; on the other hand, smoothly dealing with abstraction without having to build a detailed concrete model is one of the major 'selling points' of automata learning.
The lab-based tutorial session will guide through the development of a learning setup for a real life application, comprising most of the addressed problems and phenomena. Advanced techniques 2h lecture, 2h tutorial This final session will summarize the essence of the course in a way that highlights ongoing work, perspectives, and open problems. In particular, it will support students to have a jump start for this challenge, which will also provide a "best student solution" award.
We give a short introduction to automata over infinite strings and the associated class of "regular omega-languages" and then focus on a self-contained solution of the fundamental theorem on regular infinite games, the "Buechi-Landweber Theorem" It shows how to decide who of the two players wins a regular infinite game, and how to construct a finite-state winning strategy for the winner.
In modern terms, this solves the controller symthesis problem for regular specifications. The given proof is a result of decades of work in polishing the theory.
The last part of the tutorial is devoted to an overview of recent developments, including context-free specifications and aspects of optimization. Church's problem and a tour through automata theory. Avron, N. Dershowitz, and A. Springer, , pages Their relationships with regular expressions and derivatives will be introduced. We will study the basic concept of cover automata for finite languages and several algorithms for constructing a minimal cover automaton from a given finite language.
The state complexity of regular languages will also be studied. The basic concept and motivations will be introduced.
A number of results on the state complexity of individual operations and combined operations will be studied.