| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438420 | Theoretical Computer Science | 2007 | 7 Pages |
Abstract
We consider the ranked alphabet Σ consisting of a binary symbol. We give a rewrite system R over Σ such that R effectively preserves recognizability on any ranked alphabet obtained by adding finitely many nullary symbols to Σ. However, R does not preserve recognizability on the ranked alphabet obtained by adding one unary and one nullary symbol to Σ.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
