Restricted accessResearch articleFirst published online 1991

A Note on Pf(k) – Parsable Languages

and

Volume 14, Issue 3https://doi.org/10.3233/FI-1991-14302

Abstract

This paper investigates the class of regular languages which are pf(k) – parsable. It is shown that k induces an infinite hierarchy in the family of regular languages and that every regular language is a homomorphic image of a pf(O) -parsable language. A pumping lemma for pf – parsable languages is also provided.

Keywords

pumping lemma

Get full access to this article

View all access options for this article.