Thue systems as rewriting systems
Journal of Symbolic Computation
Church-Rosser Thue systems and formal languages
Journal of the ACM (JACM)
Complexity analysis of term-rewriting systems
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Computability and complexity: from a programming perspective
Computability and complexity: from a programming perspective
Regular Article: Forbidden Words in Symbolic Dynamics
Advances in Applied Mathematics
McNaughton families of languages
Theoretical Computer Science
On some families of languages related to the Dyck language
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Computing forbidden words of regular languages
Fundamenta Informaticae - Special issue on computing patterns in strings
The dimensions of individual strings and sequences
Information and Computation
Computation: finite and infinite machines
Computation: finite and infinite machines
| Hi-index | 0.00 |
We characterize sets of strings using two central properties from rewriting: normalization and termination. We recall the well-known result that any recursively enumerable set of strings can occur as the set of normalizing strings over a "small" alphabet if the rewriting system is allowed access to a "larger" alphabet (and extend the result to termination). We then show that these results do not hold when alphabet extension is disallowed. Finally, we prove that for every reasonably well-behaved deterministic time complexity class, there is a set of strings complete for the class that also occurs as the set of normalizing or terminating strings, without alphabet extension.