Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

CORR
2008
Springer

favoriteEmaildiscussreport

88views Education» more CORR 2008»

Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages

13 years 11 months ago

Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages

Download drops.dagstuhl.de

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:

Christian Glasser, Heinz Schmitz, Victor L. Seliva

Real-time Traffic

Boolean Hierarchies | Boolean Hierarchy | CORR 2008 | Dot-depth Hierarchy | Education |

claim paper

Related Content

» The Theory of Grammar Constraints

» Efficient asymmetric inclusion between regular expression types

» On the Representation of Timed Polyhedra

» Using Contextual Representations to Efficiently Learn ContextFree Languages

» Around Dot Depth Two

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Christian Glasser, Heinz Schmitz, Victor L. Selivanov

Comments (0)