Around Dot-depth One

Details Around Dot-depth One Around Dot-depth One

2011-03-07

arxiv.org/abs/1103.1353v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

The dot-depth hierarchy is a classification of star-free languages. It is related to the quantifier alternation hierarchy of first-order logic over finite words. We consider fragments of languages with dot-depth 1/2 and dot-depth 1 obtained by prohibiting the specification of prefixes or suffixes. As it turns out, these language classes are in one-to-one correspondence with fragments of existential first-order logic without min- or max-predicate. For all fragments, we obtain effective algebraic characterizations. Moreover, we give new combinatorial proofs for the decidability of the membership problem for dot-depth 1/2 and dot-depth 1.

Affiliated with

Also associated with

No associations

Rating

Around Dot-depth One does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Around Dot-depth One, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Around Dot-depth One will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-607827