论文信息 - Complete Characterization of Zero-expressible Functions

Complete Characterization of Zero-expressible Functions

We describe an intersection of the family of expressible relations and another natural family of relations. This is the first result of this kind existing in the literature. To obtain it we extend a tool for proving nonexpressibility of languages to a tool for proving nonexpressibility of relations.

Robert Dabrowski | Wojciech Plandowski

[1] Arcot Rajasekar. Applications in Constraint Logic Programming with Strings , 1994, PPCP.

[2] A. Razborov. ON SYSTEMS OF EQUATIONS IN A FREE GROUP , 1985 .

[3] J. Richard Büchi,et al. Definability in the Existential Theory of Concatenation and Undecidable Extensions of this Theory , 1988, Math. Log. Q..

[4] Wojciech Plandowski,et al. The expressibility of languages and relations by word equations , 1997, JACM.

[5] Wojciech Plandowski,et al. An efficient algorithm for solving word equations , 2006, STOC '06.

[6] Wojciech Plandowski,et al. On the expressibility of languages by word equations with a bounded number of variables , 2001 .

[7] J. R. Büchi,et al. Coding in the Existential Theory of Concatenation , 1987 .

[8] Joxan Jaffar. Minimal and complete word unification , 1990, JACM.