Abstract
Pushdown automata using a limited and unlimited amount of nondeterminism are investigated. Moreover, nondeterministic steps are allowed only within certain contexts, i.e., in configurations that meet particular conditions. The relationships of the accepted language families with closures of the deterministic context-free languages (\(\textrm{DCFL}\)) under regular operations are studied. For example, automata with unbounded nondeterminism that have to empty their pushdown store up to the initial symbol in order to make a guess are characterized by the regular closure of \(\textrm{DCFL}\). Automata that additionally have to reenter the initial state are (almost) characterized by the Kleene star closure of the union closure of the prefix-free deterministic context-free languages. Pushdown automata with bounded nondeterminism are characterized by the union closure of \(\textrm{DCFL}\) in any of the considered contexts. Proper inclusions between all language classes discussed are shown. Finally, closure properties of these families under AFL operations are investigated.
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
Bertsch, E., Nederhof, M.J.: Regular closure of deterministic languages. SIAM J. Comput. 29, 81–102 (1999)
Cai, L., Chen, J.: On the amount of nondeterminism and the power of verifying. SIAM J. Comput. 26, 733–750 (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., Wotschke, D.: On measuring nondeterminism in regular languages. Inform. Comput. 86, 179–194 (1990)
Goldstine, J., Leung, H., Wotschke, D.: Measuring nondeterminism in pushdown automata. J. Comput. System Sci. 71, 440–466 (2005)
Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)
Herzog, C.: Pushdown automata with bounded nondeterminism and bounded ambiguity. Theoret. Comput. Sci. 181, 141–157 (1997)
Herzog, C.: Nondeterminism in context-free languages (in German). PhD thesis, University of Frankfurt, Germany (1999)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Language, and Computation. Addison-Wesley, Reading (1979)
Hromkovič, J., Seibert, S., Karhumäki, J., Klauck, H., Schnitger, G.: Communication complexity method for measuring nondeterminism in finite automata. Inform. Comput. 172, 202–217 (2002)
Kintala, C.M.: Computations with a Restricted Number of Nondeterministic Steps. PhD thesis, Pennsylvania State University (1977)
Kintala, C.M., Wotschke, D.: Amounts of nondeterminism in finite automata. Acta Inform. 13, 199–204 (1980)
Kutrib, M.: Refining nondeterminism below linear time. J. Autom., Lang. Comb. 7, 533–547 (2002)
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.: On the amount of nondeterminism in pushdown automata. Fund. Inform. 4, 401–418 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kutrib, M., Malcher, A. (2006). Context-Dependent Nondeterminism for Pushdown Automata. In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_13
Download citation
DOI: https://doi.org/10.1007/11779148_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35428-4
Online ISBN: 978-3-540-35430-7
eBook Packages: Computer ScienceComputer Science (R0)