Publication details
Closure Properties of Linear Languages under Operations of Linear Deletion
| Authors | |
|---|---|
| Year of publication | 2006 |
| Type | Article in Proceedings |
| Conference | Proceedings of 1st International Workshop WFM'06 |
| MU Faculty or unit | |
| Citation | |
| Keywords | formal languages; regular languages; linear languages; regular deletion; linear deletion |
| Description | In this paper, we give constructive proofs that linear languages are closed under operations of regular deletion and that they are not closed under operations of linear deletion. The operations are called random parallel, parallel, sequential, scattered sequential, and multiple scattered sequential deletion. In addition, we prove that every recursively enumerable language can be obtained from a linear language by linear random parallel, parallel, or sequential deletion. In the conclusion, we formulate two open problems. |