Fair derivations in E0L systems

doi:10.1016/0020-0190(85)90047-X

Information Processing Letters

Volume 20, Issue 4, 10 May 1985, Pages 183-188

https://doi.org/10.1016/0020-0190(85)90047-X Get rights and content

Abstract

This paper deals with the concept of fairness with respect to E0L systems. Fairness of derivations in synchronized E0L systems (SE0L) is defined by generalizing the notion of fairness in context-free derivations. It is proved that all SE0L systems are fairly terminating. As a corollary it is shown that all context-free languages can be fairly generated. It is also shown that the union, catenation and +-closure of SE0L systems are also fairly terminating.

References (9)

G.T. Herman
Closure properties of some families of languages associated with biological systems
Information and Control
(1974)
S. Porat et al.
Fair derivations in context-free grammars
Information and Control
(1982)
R. Siromoney
On equal matrix languages
Information and Control
(1969)
N. Francez
Draft copy of a book on Fairness
(1983)

There are more references available in the full text version of this article.

Cited by (3)

Fairness in context-free grammars under every choice-strategy
1989, Information and Computation
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.
Machine characterization of terminal weighted eol languages
1994, International Journal of Computer Mathematics
Fairness on Synchronized EOL Array Systems
1988, International Journal of Computer Mathematics

View full text

Information Processing Letters

Fair derivations in E0L systems

Abstract

Closure properties of some families of languages associated with biological systems

Information and Control

Fair derivations in context-free grammars

Information and Control

On equal matrix languages

Information and Control

Draft copy of a book on Fairness

Fairness in context-free grammars under every choice-strategy

Machine characterization of terminal weighted eol languages

Fairness on Synchronized EOL Array Systems