Affiliation:
1. Institut für Informatik, Universität Giessen, Arndtstr. 2, D-35392 Giessen, Germany
Abstract
Non-recursive trade-offs between different representations of languages reveal a basic phenomenon. The gain in economy of description can be arbitrary. The purpose of this paper is to survey the main aspects and results regarding different representations of languages whose relative succinctness is not recursively bounded. Basic properties of descriptional systems and reasonable size measures are addressed, and the unified fundamental proof schemes emerging from the literature are presented. A comprehensive overview of results is given. Finally, some new results are shown. In particular, it is proved that between each two levels of the infinite one-way k-head finite automata hierarchies there is a non-recursive trade-off. Moreover, non-recursive trade-offs are shown between nondeterministic 2-head and deterministic k-head automata.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Syntax checking either way;Theoretical Computer Science;2023-07
2. Languages Generated by Conjunctive Query Fragments of FC[REG];Developments in Language Theory;2023
3. Hot Current Topics of Descriptional Complexity;IFIP Advances in Information and Communication Technology;2021
4. Non-Recursive Trade-Offs Are “Almost Everywhere”;Computing with Foresight and Industry;2019
5. One-way reversible multi-head finite automata;Theoretical Computer Science;2017-06