Abstract
The simulation of deterministic pushdown automata defined over a one letter alphabet by finite state automata is investigated from a descriptional complexity point of view. We show that each unary deterministic pushdown automaton of size s can be simulated by a deterministic finite automaton with a number of states which is exponential in s. We prove that this simulation is tight. Furthermore, its cost cannot be reduced even if it is performed by a two-way nondeterministic automaton. We also prove that there are unary languages for which deterministic pushdown automata cannot be exponentially more succinct than finite automata. In order to state this result, we investigate the conversion of deterministic pushdown automata into context-free grammars. We prove that in the unary case the number of variables in the resulting grammar is strictly lower than the number of variables needed in the case of nonunary alphabets.
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
Althöfer, I.: Tight lower bounds for the length of word chains. Information Processing Letters 34, 275–276 (1990)
Berstel, J., Carton, O.: On the complexity of Hopcroft’s State Minimizazion Algorithm. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 35–44. Springer, Heidelberg (2005)
de Bruijn, N.: A combinatorial problem. Proc. Kon. Nederl. Akad. Wetensch 49, 758–764 (1946)
Domaratzki, M., Pighizzini, G., Shallit, J.: Simulating finite automata with context-free grammars. Information Processing Letters 84, 339–344 (2002)
Ginsburg, S., Greibach, S.: Deterministic context-free languages. Information and Control 9, 563–582 (1966)
Ginsburg, S., Rice, H.: Two families of languages related to ALGOL. Journal of the ACM 9, 350–371 (1962)
Goldstine, J., Price, J., Wotschke, D.: A pushdown automaton or a context-free grammar – Which is more economical? Theoretical Computer Science 18, 33–40 (1982)
Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)
Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Knuth, D.: On the translation of languages from left to right. Information and Control 8, 607–639 (1965)
Mereghetti, C., Pighizzini, G.: Two-way automata simulations and unary languages. J. Aut.Lang.Combin. 5, 287–300 (2000)
Mereghetti, C., Pighizzini, G.: Optimal simulations between unary automata. SIAM J. Comput. 30, 1976–1992 (2001)
Meyer, A., Fischer, M.: Economy of description by automata, grammars, and formal systems. In: Proc.12th Ann. IEEE Symp.on Switching and Automata Theory, pp. 188–191 (1971)
Pighizzini, G., Shallit, J., Wang, M.-W.: Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. Journal of Computer and System Sciences 65, 393–414 (2002)
Sénizergues, G.: The equivalence problem for deterministic pushdown automata is decidable. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 671–682. Springer, Heidelberg (1997)
Stearns, R.: A regularity test for pushdown machines. Information and Control 11, 323–340 (1967)
Valiant, L.: Regularity and related problems for deterministic pushdown automata. Journal of the ACM 22, 1–10 (1975)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pighizzini, G. (2008). Deterministic Pushdown Automata and Unary Languages. In: Ibarra, O.H., Ravikumar, B. (eds) Implementation and Applications of Automata. CIAA 2008. Lecture Notes in Computer Science, vol 5148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70844-5_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-70844-5_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70843-8
Online ISBN: 978-3-540-70844-5
eBook Packages: Computer ScienceComputer Science (R0)