Pumping lemmas for linear and nonlinear context-free languages

Details Pumping lemmas for linear and nonlinear context-free languages Pumping lemmas for linear and nonlinear context-free languages

2010-11-30

arxiv.org/abs/1012.0023v1

Acta Univ. Sapientiae Informatica, vol. 2, no. 2 (2010) 194-209

Computer Science

Formal Languages and Automata Theory

Scientific paper

Pumping lemmas are created to prove that given languages are not belong to certain language classes. There are several known pumping lemmas for the whole class and some special classes of the context-free languages. In this paper we prove new, interesting pumping lemmas for special linear and context-free language classes. Some of them can be used to pump regular languages in two place simultaneously. Other lemma can be used to pump context-free languages in arbitrary many places.

Affiliated with

Also associated with

No associations

Rating

Pumping lemmas for linear and nonlinear context-free 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 Pumping lemmas for linear and nonlinear context-free languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pumping lemmas for linear and nonlinear context-free languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-574102