Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages

Abstract. The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability) were previously not known. We develop new forbidden-chain characterizations for the single levels of these hierarchies and obtain the following results:

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Christian Glasser, Heinz Schmitz, Victor L. Selivanov
• Keywords: Boolean Hierarchies, Boolean Hierarchy, CORR 2008, Dot-depth Hierarchy, Education