Algorithms for inclusion into a regular language

ABSTRACT. We revisit the classical problem to decide whether a language (regular or context-free) is included into a regular language. By relying on fixpoint characterizations, dualization and abstract interpretation we obtain various algorithms. We connect those to existing algorithms.

Authors

• Pierre Ganty

Keywords

No keywords are indexed for this paper.