Descriptional Complexity of Bounded Context-Free Languages
Finite-turn pushdown automata (PDA) are investigated concerning their descriptional complexity. It is known that they accept exactly the class of ultralinear context-free languages. Furthermore, the increase in size when converting arbitrary PDAs accepting ultralinear languages to finite-turn PDAs cannot be bounded by any recursive function. The latter phenomenon is known as non-recursive trade-off. In this paper, finite-turn PDAs accepting letter-bounded languages are considered. It turns out that in this case the non-recursive trade-off is reduced to a recursive trade-off, more precisely, to an exponential trade-off. A conversion algorithm is presented and the optimality of the construction is shown by proving tight lower bounds. Furthermore, the question of reducing the number of turns of a given finite-turn PDA is studied. Again, a conversion algorithm is provided which shows that in this case the trade-off is at most polynomial.
Keywordsautomata and formal languages descriptional complexity finite-turn pushdown automata recursive trade-offs bounded languages
Unable to display preview. Download preview PDF.
- 8.Malcher, A.: On recursive and non-recursive trade-offs between finite-turn pushdown automata. In: Descriptional Complexity of Formal Systems (DCFS 2005), Università degli Studi di Milano, Rapporto Tecnico 06-05, pp. 215–226 (2005)Google Scholar
- 9.Meyer, A.R., Fischer, M.J.: Economy of descriptions by automata, grammars, and formal systems. IEEE Symp. on Foundations of Computer Science, pp. 188–191 (1971)Google Scholar