1. Flow languages equal recursively enumerable languages;Araki;Acta Inform.,1981
2. Algebraic and Automata-Theoretic Properties of Formal Languages;Ginsburg,1975
3. Introduction to Formal Language Theory;Harrison,1978
4. Universe problem for unrestricted flow languages;Iwama;Acta Inform.,1983
5. Unique decomposability of shuffled strings; a formal treatment of asynchronous time-multiplexed communication;Iwama;Proc. 5th Ann. ACM Symp. on Theory of Computing,1983