Substitution in families of languages
暂无分享,去创建一个
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.
[1] Calvin C. Elgot,et al. Realization of Events by Logical Nets , 1958, JACM.
[2] Seymour Ginsburg,et al. Studies In Abstract Families Of Languages , 1969 .
[3] Seymour Ginsburg,et al. Derivation-Bounded Languages , 1968, J. Comput. Syst. Sci..
[4] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..
[5] Seymour Ginsburg,et al. Operations Which Preserve Definability in Languages , 1963, JACM.