6533b828fe1ef96bd1288db6
RESEARCH PRODUCT
On block pumpable languages
Frank StephanHenrietta Tan Wan YikChristopher Hanrui ChakRusins Freivaldssubject
Discrete mathematicsGeneral Computer ScienceAbstract family of languagesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)0102 computer and information sciences02 engineering and technology01 natural sciencesCone (formal languages)Pumping lemma for regular languagesTheoretical Computer ScienceCombinatoricsRegular languageIntersection010201 computation theory & mathematicsBlock (programming)0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingHomomorphismPumping lemma for context-free languagesComputer Science::Formal Languages and Automata TheoryMathematicsdescription
Ehrenfeucht, Parikh and Rozenberg gave an interesting characterisation of the regular languages called the block pumping property. When requiring this property only with respect to members of the language but not with respect to nonmembers, one gets the notion of block pumpable languages. It is shown that these block pumpable are a more general concept than regular languages and that they are an interesting notion of their own: they are closed under intersection, union and homomorphism by transducers; they admit multiple pumping; they have either polynomial or exponential growth.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2016-01-01 | Theoretical Computer Science |