Abstract
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.
Jakob Grue Simonsen is partially supported by the Sapere Aude grant “Complexity through Logic and Algebra” (COLA).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Béal, M.-P., Crochemore, M., Mignosi, F., Restivo, A., Sciortino, M.: Computing forbidden words of regular languages. Fundamenta Informaticae 56(1-2), 121–135 (2003)
Béal, M.-P., Mignosi, F., Restivo, A., Sciortino, M.: Forbidden words in symbolic dynamics. Advances in Applied Mathematics 25, 163–193 (2000)
Beaudry, M., Holzer, M., Niemann, G., Otto, F.: McNaughton families of languages. Theoretical Computer Science 290(3), 1581–1628 (2003)
Book, R.: Thue systems as rewriting systems. Journal of Symbolic Computation 3(1-2), 39–68 (1987)
Book, R., Otto, F.: String Rewriting. Texts and Monographs in Computer Science. Springer (1993)
Chomsky, N.: Syntactic Structures. Mouton & Co. (1957)
Choppy, C., Kaplan, S., Soria, M.: Complexity analysis of term-rewriting systems. Theoretical Computer Science 67(2&3), 261–282 (1989)
Davis, M.: Computability and Unsolvability. Dover Publications Inc. (1982) (Originally published in 1958 by McGraw-Hill Book Company)
Jones, N.D.: Computability and Complexity from a Programming Perspective. The MIT Press (1997)
Lutz, J.H.: The dimensions of individual strings and sequences. Information and Computation 187(1), 49–79 (2003)
McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. Journal of the Association for Computing Machinery 35(2), 324–344 (1988)
Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall Series in Automatic Computation. Prentice-Hall (1967)
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)
Sipser, M.: Introduction to the Theory of Computation, 2nd edn. Thomson Course Technology (2006)
Terese (ed.): Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ketema, J., Simonsen, J.G. (2012). Characterizing Languages by Normalization and Termination in String Rewriting. In: Yen, HC., Ibarra, O.H. (eds) Developments in Language Theory. DLT 2012. Lecture Notes in Computer Science, vol 7410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31653-1_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-31653-1_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31652-4
Online ISBN: 978-3-642-31653-1
eBook Packages: Computer ScienceComputer Science (R0)