Abstract
We briefly summarize some of the findings on non-recursive trade-offs, which were first observed by Meyer and Fischer in their seminal paper on “Economy of Description by Automata, Grammars, and Formal Systems” in 1971. This general phenomenon is about conversion problems between different (computational) description models that cannot be solved efficiently. Indeed, they evade solvability a forteriori because the change in description size caused by such a conversion cannot be bounded above by any recursive function. Hence, a result on non-recursive trade-offs can alternatively be interpreted as a compression of the description model with arbitrary space gains. Since 1971 there has been a steadily growing list of results where this phenomenon has been observed, and it appears that non-recursive trade-offs are “almost everywhere.”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aho, A.V.: Indexed grammars - an extension of context-free grammars. J. ACM 15, 647–671 (1968)
Bordihn, H., Holzer, M., Kutrib, M.: Unsolvability levels of operation problems for subclasses of context-free languages. Int. J. Found. Comput. Sci. 16, 423–440 (2005)
Buntrock, G., Loryś, K.: On growing context-sensitive languages. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 77–88. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-55719-9_65
Cudia, D.F.: The degree hierarchy of undecidable problems of formal grammars. In: Symposium on Theory of Computing (STOC 1970), pp. 10–21. ACM Press (1970)
Dahlhaus, E., Warmuth, M.K.: Membership for growing context-sensitive grammars is polynomial. J. Comput. Syst. Sci. 33, 456–472 (1986)
Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. J. UCS 8, 193–234 (2002)
Gruber, H., Holzer, M., Kutrib, M.: On measuring non-recursive trade-offs. J. Autom. Lang. Comb. 15, 107–120 (2010)
Hartmanis, J.: On the succinctness of different representations of languages. SIAM J. Comput. 9, 114–120 (1980)
Hartmanis, J.: On Gödel speed-up and succinctness of language representations. Theoret. Comput. Sci. 26, 335–342 (1983)
Hartmanis, J., Baker, T.P.: Relative succinctness of representations of languages and separation of complexity classes. In: Bečvář, J. (ed.) MFCS 1979. LNCS, vol. 74, pp. 70–88. Springer, Heidelberg (1979). https://doi.org/10.1007/3-540-09526-8_6
Hartmanis, J., Baker, T.P.: Succinctness, verifiability and determinism in representations of polynomial-time languages. In: IEEE Symposium on Foundations and Computer Science, pp. 392–396 (1979)
Herzog, C.: Pushdown automata with bounded nondeterminism and bounded ambiguity. Theoret. Comput. Sci. 181, 141–157 (1997)
Holzer, M., Kutrib, M.: Descriptional complexity - an introductory survey. In: Scientific Applications of Language Methods, pp. 1–58. Imperial College Press (2010)
Holzer, M., Kutrib, M.: One-time nondeterministic computations. Int. J. Found. Comput. Sci. (to appear)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Boston (1979)
Kapoutsis, C.A.: From \(k+1\) to \(k\) heads the descriptive trade-off is non-recursive. In: Descriptional Complexity of Formal Systems (DCFS 2004), pp. 213–224 (2004)
Kutrib, M.: On the descriptional power of heads, counters, and pebbles. Theoret. Comput. Sci. 330, 311–324 (2005)
Kutrib, M.: The phenomenon of non-recursive trade-offs. Int. J. Found. Comput. Sci. 16, 957–973 (2005)
Malcher, A.: Descriptional complexity of cellular automata and decidability questions. J. Autom. Lang. Comb. 7, 549–560 (2002)
Malcher, A.: On the descriptional complexity of iterative arrays. IEICE Trans. Inf. Syst. E87-D, 721–725 (2004)
Malcher, A.: On recursive and non-recursive trade-offs between finite-turn pushdown automata. J. Autom. Lang. Comb. 12, 265–277 (2007)
Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: Symposium on Switching and Automata Theory (SWAT 1971), pp. 188–191. IEEE (1971)
Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)
Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York (1980)
Schmidt, E.M., Szymanski, T.G.: Succinctness of descriptions of unambiguous context-free languages. SIAM J. Comput. 6, 547–553 (1977)
Sunckel, B.: On the descriptional complexity of metalinear CD grammar systems. In: Descriptional Complexity of Formal Systems (DCFS 2004), pp. 260–273 (2004)
Valiant, L.G.: Regularity and related problems for deterministic pushdown automata. J. ACM 22, 1–10 (1975)
Valiant, L.G.: A note on the succinctness of descriptions of deterministic languages. Inform. Control 32, 139–145 (1976)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Holzer, M., Kutrib, M. (2019). Non-Recursive Trade-Offs Are “Almost Everywhere”. In: Manea, F., Martin, B., Paulusma, D., Primiero, G. (eds) Computing with Foresight and Industry. CiE 2019. Lecture Notes in Computer Science(), vol 11558. Springer, Cham. https://doi.org/10.1007/978-3-030-22996-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-22996-2_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-22995-5
Online ISBN: 978-3-030-22996-2
eBook Packages: Computer ScienceComputer Science (R0)