Abstract
A generalization of pushdown automata towards regulated nondeterminism is studied. The nondeterminism is governed in such a way that the decision, whether or not a nondeterministic rule is applied, depends on the whole content of the stack. More precisely, the content of the stack is considered as a word over the stack alphabet, and the pushdown automaton is allowed to act nondeterministically, if this word belongs to some given set R of control words. Otherwise its behavior is deterministic. The computational capacity of such R -PDAs depends on the complexity of R. It turns out that non-context-free languages are accepted even if R is a linear, deterministic context-free language. On the other hand, regular control sets R do not increase the computational capacity of nondeterministic pushdown automata. This raises the natural question for the relations between the structure and complexity of regular sets R on one hand and the computational capacity of the corresponding R -PDA on the other hand. Clearly, if R is empty, the deterministic context-free languages are characterized. For R = {a,b}* one obtains all context-free languages. Furthermore, if R is finite, then the regular closure of the deterministic context-free languages is described. We investigate these questions, and discuss closure properties of the language classes in question under AFL operations.
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
Autebert, J.M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Handbook of Formal Languages, vol. 1, pp. 111–174. Springer, Berlin (1997)
Bertsch, E., Nederhof, M.J.: Regular closure of deterministic languages. SIAM J. Comput. 29, 81–102 (1999)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)
Dassow, J., Păun, G., Salomaa, A.: Grammars with controlled derivations. In: Handbook of Formal Languages, vol. 2, pp. 101–154. Springer, Berlin (1997)
Fischer, P.C., Kintala, C.M.R.: Real-time computations with restricted nondeterminism. Math. Systems Theory 12, 219–231 (1979)
Goldsmith, J., Levy, M.A., Mundhenk, M.: Limited nondeterminism. SIGACT News 27, 20–29 (1996)
Goldstine, J., Kintala, C.M.R., Wotschke, D.: On measuring nondeterminism in regular languages. Inform. and Comput. 86, 179–194 (1990)
Goldstine, J., Leung, H., Wotschke, D.: On the relation between ambiguity and nondeterminism in finite automata. Inform. and Comput. 100, 261–270 (1992)
Goldstine, J., Leung, H., Wotschke, D.: Measuring nondeterminism in pushdown automata. J. Comput. System Sci. 71, 440–466 (2005)
Goldstine, J., Price, J.K., Wotschke, D.: On reducing the number of stack symbols in a PDA. Math. Systems Theory 26, 313–326 (1993)
Herzog, C.: Pushdown automata with bounded nondeterminism and bounded ambiguity. Theoret. Comput. Sci. 181, 141–157 (1997)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Co., Reading, Mass. (1979)
Kintala, C.M.R.: Computations with a restricted number of nondeterministic steps. PhD thesis, Pennsylvania State University (1977)
Kintala, C.M.R., Wotschke, D.: Amounts of nondeterminism in finite automata. Acta Inform. 13, 199–204 (1980)
Kutrib, M.: Refining nondeterminsim below linear time. J. Autom. Lang. Comb. 7, 533–547 (2002)
Kutrib, M., Malcher, A.: Context-dependent nondeterminism for pushdown automata. Theoret. Comput. Sci. 376, 101–111 (2007)
Meduna, A., Kolář, D.: Regulated pushdown automata. Acta Cybernet. 14, 653–664 (2000)
Meduna, A., Kolář, D.: One-turn regulated pushdown automata and their reduction. Fund. Inform. 51, 399–405 (2002)
Salomaa, A.: Formal Languages. Academic Press, New York (1973)
Salomaa, K., Yu, S.: Limited nondeterminism for pushdown automata. Bull. EATCS 50, 186–193 (1993)
Salomaa, K., Yu, S.: Measures of nondeterminism for pushdown automata. J. Comput. System Sci. 49, 362–374 (1994)
Vermeir, D., Savitch, W.J.: On the amount of nondeterminism in pushdown automata. Fund. Inform. 4, 401–418 (1981)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kutrib, M., Malcher, A., Werlein, L. (2007). Regulated Nondeterminism in Pushdown Automata. In: Holub, J., Žďárek, J. (eds) Implementation and Application of Automata. CIAA 2007. Lecture Notes in Computer Science, vol 4783. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76336-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-76336-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76335-2
Online ISBN: 978-3-540-76336-9
eBook Packages: Computer ScienceComputer Science (R0)