Insertion languages

[1]  Joanna Jedrzejowicz.  On the Enlargement of the Class of Regular Languages by the Shuffle Closure , 1983, Inf. Process. Lett..

[2]  Colm Ó'Dúnlaing.  Infinite Regular Thue Systems , 1983, Theor. Comput. Sci..

[3]  David Henry Haussler.  Insertion and iterated insertion as operations on formal languages , 1982 .

[4]  Ronald V. Book,et al.  Confluent and Other Types of Thue Systems , 1982, JACM.

[5]  Matthias Jantzen.  The Power of Synchronizing Operations on Strings , 1981, Theor. Comput. Sci..

[6]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[7]  Alan C. Shaw,et al.  Software Descriptions with Flow Expressions , 1978, IEEE Transactions on Software Engineering.

[8]  William C. Rounds,et al.  Complexity of expressions allowing concurrency , 1978, POPL '78.

[9]  Y. Cochet,et al.  Une Generalisation des Ensembles de Dyck , 1971 .

[10]  Jozef Gruska.  A Characterization of Context-free Languages , 1971, J. Comput. Syst. Sci..

[11]  Sheila A. Greibach,et al.  Full AFLs and Nested Iterated Substitution , 1969, Inf. Control..

[12]  Dana S. Scott,et al.  Some Definitional Suggestions for Automata Theory , 1967, J. Comput. Syst. Sci..

[13]  Noam Chomsky,et al.  The Algebraic Theory of Context-Free Languages* , 1963 .

[14]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[15]  Emil L. Post.  A variant of a recursively unsolvable problem , 1946 .

[16]  M. Newman.  On Theories with a Combinatorial Definition of "Equivalence" , 1942 .

[17]  A. Church,et al.  Some properties of conversion , 1936 .