Lia Schütze

"Run Embeddings and Pumping Schemes"

In the theory of computation, we are faced with an ever-increasing number of computational models and an equally-increasing number of problems we would like answered for these models. We therefore turn towards abstractions which generalize more concrete models. In this, we hope to find algorithms that are immediately applicable to a broad range of models. In this talk, we present an abstraction called Embedding Systems. These allow us to formulate algorithms for checking properties of the language of a system. We will investigate which models can be generalized to Embedding System and which problems can be solved this way.

Termin als Datei downloaden und in den Kalender importieren.