Abstract
Two-way nondeterministic pushdown automata (\(\textrm{2PDA}\)) are classical nondeterministic pushdown automata (\(\textrm{PDA}\)) enhanced with two-way motion of the input head. In this paper, the subclass of \(\textrm{2PDA}\) accepting bounded languages and making at most a constant number of input head turns is studied with respect to descriptional complexity aspects. In particular, the effect of reducing the number of pushdown reversals to a constant number is of interest. It turns out that this reduction leads to an exponential blow-up in case of nondeterministic devices, and to a doubly-exponential blow-up in case of deterministic devices. If the restriction on boundedness of the languages considered and on the finiteness of the number of head turns is dropped, the resulting trade-offs are no longer bounded by recursive functions, and so-called non-recursive trade-offs are shown.
Partially supported by CRUI/DAAD under the project “Programma Vigoni: Descriptional Complexity of Non-Classical Computational Models”.
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
Preview
Unable to display preview. Download preview PDF.
References
Baker, B.S., Book, R.V.: Reversal-Bounded multipushdown machines. Journal of Computer and System Sciences 8, 315–322 (1974)
Geffert, V., Mereghetti, C., Palano, B.: More concise representation of regular languages by automata and regular expressions. Information and Computation 208, 385–394 (2010)
Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. Journal of Universal Computer Science 8, 193–234 (2002)
Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York (1966)
Gurari, E.M., Ibarra, O.H.: The complexity of the equivalence problem for two characterizations of Presburger sets. Theoretical Computer Science 13, 295–314 (1981)
Hartmanis, J.: On the succinctness of different representations of languages. SIAM Journal on Computing 9, 114–120 (1980)
Holzer, M., Kutrib, M.: Descriptional complexity—an introductory survey. In: Martín-Vide, C. (ed.) Scientific Applications of Language Methods, pp. 1–58. Imperial College Press, London (2010)
Holzer, M., Kutrib, M.: The complexity of regular(-like) expressions. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 16–30. Springer, Heidelberg (2010)
Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: origins and directions. Theoretical Computer Science 412, 83–96 (2011)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Language, and Computation. Addison-Wesley, Reading (1979)
Ibarra, O.H.: A note on semilinear sets and bounded-reversal multihead pushdown automata. Information Processing Letters 3, 25–28 (1974)
Ibarra, O.H., Jiang, T., Tran, N., Wang, H.: New decidability results concerning two-way counter machines. SIAM Journal on Computing 24, 123–137 (1995)
Leiss, E.: Succinct representation of regular languages by Boolean automata. Theoretical Computer Science 13, 323–330 (1981)
Liu, L.Y., Weiner, P.: Finite-reversal pushdown automata and semi-linear sets. In: Proc. of Sec. Ann. Princeton Conf. on Inf. Sciences and Systems, pp. 334–338 (1968)
Malcher, A.: Descriptional complexity of cellular automata and decidability questions. Journal of Automata, Languages and Combinatorics 7, 549–560 (2002)
Malcher, A.: On recursive and non-recursive trade-offs between finite-turn pushdown automata. Journal of Automata, Languages and Combinatorics 12, 265–277 (2007)
Malcher, A., Pighizzini, G.: Descriptional complexity of bounded context-free languages. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 312–323. Springer, Heidelberg (2007); http://arxiv.org/abs/0905.1045 (for an extended version)
Meyer, A.R., Fischer, M.J.: Economy of descriptions by automata, grammars, and formal systems. In: IEEE Symposium on Foundations of Computer Science, pp. 188–191 (1971)
Rosen, K.H.: Handbook of discrete and combinatorial mathematics. CRC Press, Boca Raton (2000)
Pighizzini, G., Shallit, J., Wang, M.W.: Unary context-free grammmars and pushdown automata, descriptional complexity and auxiliary space lower bounds. Journal of Computer and System Sciences 65, 393–414 (2002)
Valiant, L.G.: Regularity and related problems for deterministic pushdown automata. Journal of the ACM 22, 1–10 (1975)
Valiant, L.G.: A note on the succinctness of descriptions of deterministic languages. Information and Control 32, 139–145 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Malcher, A., Mereghetti, C., Palano, B. (2011). Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals. In: Holzer, M., Kutrib, M., Pighizzini, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22600-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-22600-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22599-4
Online ISBN: 978-3-642-22600-7
eBook Packages: Computer ScienceComputer Science (R0)