Size/lookahead tradeoff for LL(k)-grammars

Authors:
E. Bertsch;M.-J. Nederhof
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
2001

Citing 0
Cited 2

Succinct description of regular languages by weak restarting automata

Information and Computation
On recursive and non-recursive trade-offs between finite-turn pushdown automata

Journal of Automata, Languages and Combinatorics

Quantified Score

Hi-index	0.89

Visualization

Abstract