Article thumbnail
Location of Repository

Non-structural subtype entailment in automata theory

By Joachim Niehren and Tim Priesnitz

Abstract

Decidability of non-structural subtype entailment is a long-standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize the problem equivalently by using regular expressions and word equations. This characterization induces new results on non-structural subtype entailment, constitutes a promising starting point for further investigations on decidability, and explains for the first time why the problem is so difficult. The difficulty is caused by implicit word equations that we make explicit

Topics: Logik des Entailment, Automata Theory, Data processing Computer science
Publisher: Fakultät 6 - Naturwissenschaftlich-Technische Fakultät I. Fachrichtung 6.2 - Informatik
Year: 2003
OAI identifier: oai:scidok.sulb.uni-saarland.de:256

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.