The strong independence of substitution and homomorphic replication

 Access to full text

 Full (PDF)

1. 1. A. V. AHO, Indexed Grammars. An Extension of Context-Free Grammars, J. Assoc. Comp. Mach., Vol. 15, 1968, pp. 647-671. Zbl0175.27801MR258547
2. 2. P. ASVELD and J. ENGELFRIET, Iterated Deterministic Substitution, Acta Informatica, Vol. 8, 1977, pp. 285-302. Zbl0343.68034MR478764
3. 3. R. BOOK, Simple Representations of Certain Classes of Languages, J. Assoc. Comp. Mach., Vol. 25, 1978, pp. 23-31. Zbl0364.68073MR461992
4. 4. R. BOOK and M. NIVAT, Linear Languages and the Intersection Closures of Classes of Languages, S.I.A.M. J. Computing, Vol. 7, 1978, pp. 167-177. Zbl0376.68049MR492911
5. 5. R. BOOK and C. WRATHALL, On Languages Specified byRelative Acceptance, Theoret. Comp. Science (to appear). Zbl0385.68061
6. 6. R. W. EHRICH and S. S. YAU, Two-Way Sequential Transductions and Stack Automata, Inform. and Control, Vol. 18, 1971, pp. 404-446. Zbl0222.94063MR311427
7. 7. C. C. ELGOT and J. E. MEZEI, On Relations Defined by Generalized Finite Automata, I.B.M. J. Res. and Devel., Vol. 9, 1975, pp. 47-68. Zbl0135.00704MR216903
8. 8. J. ENGELFRIET and E. M. SCHMIDT, 10 and 01, J. Comput. Syst. Sc. (to appear). 
9. 9. J. ENGELFRIET and S. SKYUM, Copying Theorems, Inform. Processing Letts., Vol. 4, 1976, pp. 157-161. Zbl0323.68051MR400806
10. 10. S. GINSBURG, , Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland, Amsterdam, 1975. Zbl0325.68002MR443446
11. 11. S. GINSBURG and S. A. GREIBACH, Abstract Families of Languages, in Studies in Abstract Families of Languages GINSBURG, GREIBACH and HOPCROFT, eds., Memoirs Amer. Math. Soc., Vol. 87, 1969, pp. 1-32. Zbl0194.31402MR297491
12. 12. S. GINSBURG and S. A. GREIBACH, Principal AFL, J. Comput. Syst. Sc., Vol. 4, 1970, pp. 308-338. Zbl0198.03102MR286599
13. 13. S. GINSBURG and E. H. SPANIER, AFL with the Semilinear Property, J. Comput. Syst. Sc., Vol. 5, 1971, pp. 365-396. Zbl0235.68029MR339558
14. 14. S. GINSBURG, and E. H. SPANIER, Dérivation-Bounded Languages, J. Comput. Syst. Sc., Vol. 2, 1968, pp. 228-250. Zbl0176.16703MR241201
15. 15. S. GREIBACH, Chains of Full AFLs, Math. Syst. Theory, Vol. 4, 1970, pp. 231-242. Zbl0203.30102MR329324
16. 16. S. GREIBACH, Checking Automata and One-Way Stack Languages, J. Comput. Syst. Sc., Vol. 3, 1969, pp. 196-217. Zbl0174.02702MR243953
17. 17. S. GREIBACH, Control Sets on Context-Free Grammar Forms, J. Comput. Syst. Sc., Vol. 15, 1977, pp. 35-98. Zbl0359.68093MR502294
18. 18. S. GREIBACH, Erasing in Context-Free AFLs, Inform. and Control, Vol. 21, 1972, pp. 436-465. Zbl0248.68036MR331876
19. 19. S. GREIBACH, One-Way Finite Visit Automata, Theoret. Comput. Sc., Vol. 6, 1978, pp. 175-222. Zbl0368.68059MR489039
20. 20. S. GREIBACH, Full AFLs and Nested Iterated Substitution, Inform. and Control, Vol. 16, 1970, pp. 7-35. Zbl0188.03102MR269446
21. 21. S. GREIBACH, Syntactic Operators on Full Semi AFLs, J. Comput. Syst. Sc., Vol. 6, 1972, pp. 30-76. Zbl0269.68046MR307535
22. 22. S. GREIBACH and S. GINSBURG, Multitape AFA, J. Assoc Comput. Mach., Vol. 19, 1972, pp. 193-221. Zbl0241.68031MR300828
23. 23. O. H. IBARRA, Controlled Pushdown Automata, inform. Sc., Yol. 6, 1973, pp. 327-342. Zbl0278.68047MR327080
24. 24. N. A. KHABBAZ, Control Sets on Linear Grammars, Inform. and Control, Vol. 25, 1974, pp. 206-221. Zbl0298.68059MR356590
25. 25. N. A. KHABBAZ, A Geometrical Hierarchy of Languages, J. Comput. Syst. Sc., Vol. 8, 1974, pp. 142-157. Zbl0294.68029MR334595
26. 26. K. KLINGENSTEIN, Structures of Bounded Languages in Certain Classes of Languages, Inform. and Control (to appear). Zbl0970.65100
27. 27. K. KLINGENSTEIN, p-Matrix Languages, Theoret. Comput. Sc. (to appear). 
28. 28. A. NERODE, Linear Automata Transformations, Proc. Amer. Math. Soc., Vol. 9, 1958, pp. 541-544. Zbl0089.33403MR135681
29. 29. W. OGDEN, A Helpful Result in Proving Inherent Ambiguity, Math. Syst. Theory, Vol. 2, 1968, pp. 191-194. Zbl0175.27802MR233645
30. 30. A. SALOMAA, Formal Languages, Academic Press, New York, 1973. Zbl0262.68025MR438755
31. 31. A. SALOMAA, Macros, Iterated Substitution and Lindenmayer AFLs, DAIMI, PB-18, University of Aarhus, Aarhus, Denmark. 
32. 32. I. H. SUDBOROUGH, On the Complexity of the Membership Problem for some Extensions of Context-Free Languages, Intl. J. Computer Math. (to appear). Zbl0398.68037MR464751
33. 33. M. LATTEUX, Cônes rationnels commutativement clos, R.A.I.R.O. Informatique théorique, Vol. 11, 1977, pp. 29-51. Zbl0354.68103MR478782
34. 34. J. ENGELFRIET, Three Hierarchies of Transducers, Memo 217, Dept. Appl. Math., Twente Univ. Technology, 1978. Zbl0509.68078
35. 35. A. VAN DER WALT, Locally Linear Families of Languages, Inform. and Control, Vol. 32, 1976, pp. 27-32. Zbl0336.68031MR411265