Expanded subalphabets in the theories of languages and semigroupsFootnote†

†This research was supported by Grant MCS-8003348 of the National Science Foundation of the United States of America.

References

• Engelfriet , J. and Rozenberg , G. 1979 . Equality languages and fixed point languages . Information and Control , 43 : 20 – 49 .
   Google Scholar
• Head , T. 1981 . Fixed languages and the adult languages of OL schemes . Internat. J. Comput.Math , 10 : 103 – 107 .
   Web of Science ®Google Scholar
• Head T. Thierrin G. Wilkinson J. DOL schemes and the periodicity of string embeddings Theoretical Computer Science to appear
   Google Scholar
• Herman , G.T. and Rozenberg , G. 1975 . Developmental Systems and Languages , New York : North Holland/American Elsevier .
   Google Scholar
• Herman , G.T. and Walker , A. 1975 . Context-free languages in biological systems . Internat. j. Comput. Math , 4 : 369 – 391 .
   Web of Science ®Google Scholar
• Lallement , G. 1979 . Semigroups and Combinatorial Applications , New York : John Wiley & Sons .
   Google Scholar
• Rozenberg , G. and Salomaa , A. 1980 . The Mathematical Theory of L Systems , New York : Academic Press .
   Google Scholar
• Shyr , H.J. and Thierrin , G. 1974 . Hypercodes . Information and Control , 24 : 45 – 54 .
   Google Scholar
• Thierrin , G. 1979 . Context-free and stationary languages . Internat. J. Comput. Math , 7 : 297 – 301 .
   Web of Science ®Google Scholar
• Thierrin , G. 1975 . A mode of decomposition of regular languages . Semigroup Forum , 10 : 32 – 38 .
   Google Scholar
• Van Leeuwen , J. 1975 . On the fixed points of monogenic functions in free monoids . Semigroup Forum , 10 : 315 – 328 .
   Google Scholar