Context-Dependent Nondeterminism for Pushdown Automata

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.

[1]  Patrick C. Fischer,et al.  Real-time computations with restricted nondeterminism , 2005, Mathematical systems theory.

[2]  Jonathan Goldstine,et al.  On Measuring Nondeterminism in Regular Languages , 1990, Inf. Comput..

[3]  Detlef Wotschke,et al.  Amounts of nondeterminism in finite automata , 1980, Acta Informatica.

[4]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[5]  Sheng Yu,et al.  Measures of Nondeterminism for Pushdown Automata , 1994, J. Comput. Syst. Sci..

[6]  Martin Kutrib.  Refining Nondeterminism below Linear-Time , 2001, DCFS.

[7]  Liming Cai,et al.  On the Amount of Nondeterminism and the Power of Verifying , 1997, SIAM J. Comput..

[8]  Hartmut Klauck,et al.  Communication Complexity Method for Measuring Nondeterminism in Finite Automata , 2002, Inf. Comput..

[9]  Christian Herzog.  Pushdown Automata with Bounded Nondeterminism and Bounded Ambiguity , 1997, Theor. Comput. Sci..

[10]  Patrick C. Fischer,et al.  Computations with a restricted number of nondeterministic steps (Extended Abstract) , 1977, STOC '77.

[11]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[12]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[13]  Mark-Jan Nederhof,et al.  Regular Closure of Deterministic Languages , 1999, SIAM J. Comput..

[14]  Judy Goldsmith,et al.  Limited nondeterminism , 1996, SIGA.

[15]  Jonathan Goldstine,et al.  Measuring nondeterminism in pushdown automata , 2005, J. Comput. Syst. Sci..

[16]  Dirk Vermeir,et al.  On the amount of non-determinism in pushdown in pushdown automata , 1981, Fundam. Informaticae.