Foreword and Dedication

As computing and control are becoming increasingly interesting to both the academic researchers and management practitioners in the field of industrial engineering, it is essential to incorporate computing and control into industrial engineering from the theoretical viewpoint; it is also absolutely essential to the survival, growth and prosperity of any company to have some means to improve its efficiency and effect.

[1]  Grzegorz Rozenberg,et al.  Developmental systems and languages , 1972, STOC.

[2]  James B. Morris.  Formal Languages and their Relation to Automata , 1970 .

[3]  Hermann A. Maurer,et al.  Theoretische Grundlagen der Programmiersprachen , 1984, Reihe Informatik.

[4]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .

[5]  Michael A. Arbib,et al.  An Introduction to Formal Language Theory , 1988, Texts and Monographs in Computer Science.

[6]  Thomas V. Gamkrelidze,et al.  The Early History of Indo-European Languages , 1990 .

[7]  Peter J. Denning,et al.  Machines, Languages, And Computation , 1978 .

[8]  Gheorghe Paun,et al.  Grammar Systems: A Grammatical Approach to Distribution and Cooperation , 1995, ICALP.

[9]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[10]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[11]  Aristid Lindenmayer,et al.  Mathematical Models for Cellular Interactions in Development , 1968 .

[12]  Raymond E. Miller,et al.  Varieties of Formal Languages , 1986 .

[13]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[14]  Arto Salomaa.  Jewels of formal language theory , 1981 .

[15]  Grzegorz Rozenberg,et al.  The mathematical theory of L systems , 1980 .

[16]  H. Shyr.  Free monoids and languages , 1979 .

[17]  Gheorghe Păun,et al.  Mathematical Aspects of Natural and Formal Languages , 1994, World scientific series in computer science.

[18]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[19]  Robert McNaughton,et al.  The theory of automata , 1961 .

[20]  Arto Salomaa,et al.  Computation and Automata , 1984 .

[21]  M. Schützenberger,et al.  The equation $a^M=b^Nc^P$ in a free group. , 1962 .

[22]  Noam Chomsky,et al.  Notions sur les grammaires formelles , 1967 .

[23]  Arto Salomaa,et al.  Formal Languages: an Introduction and a Synopsis , 1997, Handbook of Formal Languages.

[24]  M. Dal Cin,et al.  The Algebraic Theory of Automata , 1980 .

[25]  Alfred V. Aho,et al.  Principles of Compiler Design , 1977 .

[26]  Seymour Ginsburg,et al.  Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .

[27]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[28]  György E. Révész.  Introduction to formal languages , 1983 .

[29]  Arto Salomaa,et al.  Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.

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

[31]  Derick Wood,et al.  Theory of computation , 1986 .

[32]  L. H. Haines.  On free monoids partially ordered by embedding , 1969 .

[33]  Robert W. Floyd,et al.  The Language of Machines: an Introduction to Computability and Formal Languages , 1994 .

[34]  Peter C. Chapin.  Formal languages I , 1973, CSC '73.

[35]  Ronald V. Book,et al.  Formal language theory : perspectives and open problems , 1980 .