Descriptional complexity of bounded context-free languages
| dc.creator | Malcher, Andreas | |
| dc.creator | Pighizzini, Giovanni | |
| dc.date | 2009-05-07 | |
| dc.date | 2009-05-08 | |
| dc.date.accessioned | 2026-07-07T13:12:41Z | |
| dc.date.available | 2026-07-07T13:12:41Z | |
| dc.description | 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 bounded languages are considered. First, letter-bounded languages are studied. We prove 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. Finally, the more general case of word-bounded languages is investigated. We show how the results obtained for letter-bounded languages can be extended to word-bounded languages. | |
| dc.description | 31 pages, 1 figure. A preliminary version was presented at DLT 2007. The full version is submitted to a journal | |
| dc.identifier | https://arxiv.org/abs/0905.1045 | |
| dc.identifier | http://arxiv.org/abs/0905.1045 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/229650 | |
| dc.subject | Formal Languages and Automata Theory | |
| dc.subject | F.1.1; F.2.3; F.4.2; F.4.3 | |
| dc.title | Descriptional complexity of bounded context-free languages | |
| dc.type | text |