Substitution in families of languages

Authors:
Seymour Ginsburg;Edwin H. Spanier
Affiliations:
-;-
Venue:
Information Sciences: an International Journal
Year:
1970

Citing 4
Cited 6

Realization of Events by Logical Nets

Journal of the ACM (JACM)
Operations Which Preserve Definability in Languages

Journal of the ACM (JACM)
Finite automata and their decision problems

IBM Journal of Research and Development
Derivation-bounded languages

Journal of Computer and System Sciences

Some independent families of one-letter languages

Journal of Computer and System Sciences
On incomparable abstract family of languages (AFL)

Journal of Computer and System Sciences
Two-way a-transducers and AFL

Journal of Computer and System Sciences
Principal AFL

Journal of Computer and System Sciences
AFL with the semilinear property

Journal of Computer and System Sciences
Syntactic operators on full semiAFLs

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.08

Visualization

Abstract

The effect of substitution in families of languages, especially an AFL (i.e., abstract family of languages), is considered. Among the main results shown are the following: The substitution of one AFL into another is an AFL. Under suitable hypotheses, the AFL generated by the family obtained from the substitution of one family into another is the family obtained from the substitution of the corresponding AFL. A condition is given for the AFL generated by the substitution closure of a family to be the substitution closure of the AFL generated by the family.