Characterizing Languages by Normalization and Termination in String Rewriting
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.
KeywordsNormal Form Transitive Closure Deterministic Turing Machine Term Rewrite System Thue System
Unable to display preview. Download preview PDF.
- 1.Avanzini, M., Moser, G.: Closing the gap between runtime complexity and polytime computability. In: Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA 2010). Leibniz International Proceedings in Informatics, vol. 6, pp. 33–48 (2010)Google Scholar
- 6.Book, R., Otto, F.: String Rewriting. Texts and Monographs in Computer Science. Springer (1993)Google Scholar
- 7.Chomsky, N.: Syntactic Structures. Mouton & Co. (1957)Google Scholar
- 8.Choppy, C., Kaplan, S., Soria, M.: Complexity analysis of term-rewriting systems. Theoretical Computer Science 67(2&3), 261–282 (1989)Google Scholar
- 9.Davis, M.: Computability and Unsolvability. Dover Publications Inc. (1982) (Originally published in 1958 by McGraw-Hill Book Company)Google Scholar
- 10.Jones, N.D.: Computability and Complexity from a Programming Perspective. The MIT Press (1997)Google Scholar
- 13.Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall Series in Automatic Computation. Prentice-Hall (1967)Google Scholar
- 14.Nivat, M.: On some families of languages related to the Dyck language. In: Proceedings of the 2nd Annual ACM Symposium on Theory of Computing (STOC 1970), pp. 221–225 (1970)Google Scholar
- 15.Sipser, M.: Introduction to the Theory of Computation, 2nd edn. Thomson Course Technology (2006)Google Scholar
- 16.Terese (ed.): Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press (2003)Google Scholar