Pushdown automata with bounded nondeterminism and bounded ambiguity

Theoretical Computer Science

Volumn 181, Issue 1, 1997, Pages 141-157

  Herzog, Christian ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; CONTEXT FREE LANGUAGES;

PUSHDOWN AUTOMATA (PDA);

AUTOMATA THEORY;

EID: 0347307509     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00267-8     Document Type: Article

References (13)

1. I. Borchhardt, Nonrecursive tradeoffs between context-free grammars with diferent constant ambiguity, Master Thesis, Universität Frankfurt/Main, 1992 (in German).
2. J. Goldstine, C.M.R. Kintala and D. Wotschke, On measuring nondeterminism in regular languages, Inform. Comput. 86 (1990)179-194.
3. M.A. Harrison, Introduction to Formal Language Theory (Addison-Wesley, Reading, MA, 1978).
4. C. Herzog, Pushdown automata with bounded nondeterminism or bounded ambiguity, Master Thesis, Universität Frankfurt/Main, 1994 (in German).
5. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation (Addison-Wesley, Reading, MA, 1979).
6. C.M.R. Kintala, Refining nondeterminism in context-free languages, Math. Systems Theory 12 (1978) 1-8.
7. C.M.R. Kintala and D. Wotschke, Amounts of nondeterminism in finite automata, Acta Inform. 13 (1980) 401-418.
8. H. Maurer, The Existence of Context-free Languages which are Inherently Ambiguous of any Degree, Dept. of Mathematics Research Series, University of Calgary, 1968.
9. K. Salomaa and S. Yu, Degrees of nondeterminism for pushdown automata, Springer Lecture Notes in Computer Science, Vol. 529 (Springer, Berlin, 1991) 380-389.
10. K. Salomaa and S. Yu, Limited nondeterminism for pushdown automata, EATCS Bull. 50 (1993) 186-193.
11. E.M. Schmidt and T.G. Szymanski, Succinctness of descriptions of unambiguous context-free languages, SIAM J. Comput. 6 (1977) 547-553.
12. L. Valiant, A note on the succinctness of descriptions of deterministic languages, Inform. and Control 32 (1976) 139-145.
13. D. Vermeir and W. Savitch, On the amount of nondeterminism in pushdown automata, Fundam. Inform. 4 (1981) 401-418.