Computer Science – Formal Languages and Automata Theory
Scientific paper
2012-02-22
Computer Science
Formal Languages and Automata Theory
Scientific paper
A study on structural properties of regular and context-free languages has promoted our basic understandings of the complex behaviors of those languages. We continue the study to examine how regular languages behave when they are "almost halving" numerous infinite languages. In particular, we are focused on a situation in which a regular language "dissects" a target infinite language into two infinite subsets. Every context-free language and its complement can be dissected by carefully chosen regular languages. By expanding the scope of our study, we show that constantly-growing languages and semi-linear languages are also dissectable; however, their complements as well as intersections are not. Under certain natural conditions, the complements and finite intersections of semi-linear languages become dissectable. Similarly, restricted to bounded languages, the intersections of finitely many bounded context-free languages and, more surprisingly, the entire Boolean hierarchy over bounded context-free languages are dissectable. As an immediate application, we show a structural property in which an appropriate bounded context-free language can separate, with infinite margins, two given infinite bounded context-free languages, one of which contains the other with an infinite margin. This property is closely related to a notion and result of Demaratzki, Shallit, and Yu (2001).
Kato Yuichi
Yamakami Tomoyuki
No associations
LandOfFree
The Dissecting Power of Regular Languages 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 The Dissecting Power of Regular Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Dissecting Power of Regular Languages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-414984