Fairness in Context-Free Grammars under Every Choice-strategy
暂无分享,去创建一个
In (Porat et al., 1982, Inform. and Control 55, 108–116) the notion of fair derivations in context-free grammars was introduced and studied. The main result there is a characterization of fairly terminating grammars as non-variable-doubling. In this paper we show that the same characterization is valid under canonical derivations in which the next variable to be expanded is deterministically chosen, leaving nondeterminism only to the decision as to which rule (of the chosen variable) to apply. Two families of canonical derivations are introduced and studied as special cases: spinal derivations and layered derivations.
[1] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[2] K. Rangarajan,et al. Fair Derivations in E0L Systems , 1985, Inf. Process. Lett..
[3] Nissim Francez,et al. Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems , 1986, CADE.
[4] Nissim Francez,et al. Fair Deriviations in Context-Free Grammars , 1982, Inf. Control..