| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429071 | Information Processing Letters | 2010 | 6 Pages |
In this paper we consider two questions. First we consider whether every pattern language which is regular can be generated by a regular pattern. We show that this is indeed the case for extended (erasing) pattern languages if alphabet size is at least four. In all other cases, we show that there are patterns generating a regular language which cannot be generated by a regular pattern. Next we consider whether there are pattern languages which are context-free but not regular. We show that, for alphabet size 2 and 3, there are both erasing and non-erasing pattern languages which are context-free but not regular. On the other hand, for alphabet size at least 4, every erasing pattern language which is context-free is also regular. It is open at present whether there exist non-erasing pattern languages which are context-free but not regular for alphabet size at least 4.
Research highlights► For alphabet sizes 1, 2, 3 there are non-regular patterns generating regular languages. ► For alphabet sizes 2, 3 some properly context-free languages are generated by patterns. ► For alphabet size 4 and more, all context-free pattern languages are regular.
