[See also combinatorics on words.] -------------------------------------------------- 7891 Alfred Aho: Pattern matching in strings. In 1105 Book, 325-347. 24767 Jiri Adamek: Free algebras and automata realizations in the language of categories. Comm. Math. Univ. Carol. 15/4 (1974), 589-602. 11581 Jean-Paul Allouche: Automates finis and theorie des nombres. Expos. Math. 5 (1987), 239-266. 1112 Michael Arbib: Algebraic theory of machines, languages, and semigroups. Academic Press 1968. Jean-Michel Autebert: Theorie des langages et des automates. Masson 1994. 7873 Jean-Michel Autebert/Jean Berstel/Luc Boasson: Context-free languages and push-down automata. Internet ca. 1994, 65. R. Baeza-Yates/C. Choffrut/G. Gonnet: On Boyer-Moore automata. Algorithmica (1995), ... Ludwig Balke/Karl-Heinz Boehling: Einfuehrung in die Automatentheorie und Theorie formaler Sprachen. Bibl. Inst. 1993, 330p. 3-411-16421-2. DM 38. 10887 Ron Bartlett: Functions, languages, and machines. Internet 1996, 180p. Contents: Sets, functions, and countability; Languages, grammars, and computability; Finite-state machines and regular grammars; Decidable properties of regular languaes; Push-down auotmata and context-free grammars; Decidable properties of context-free languages; Turing machines and unrestricted grammars; Undecidable properties of unrestricted languages; Turing machine complexity classes; Recursive functions; Cellular automata; neural networks. 10488 Marie-Pierre Beal/Dominique Perrin: Symbolic dynamics and finite automata. Internet 1999, 55p. D. Beauquier/J. Pin: Languages and scanners. Theor. Comp. Sci. 84 (1991), 3-21. 7892 Joffroy Beauquier/Maurice Nivat: Application of formal language theory to problems of security and synchronization. In 1105 Book, 407-454. D. Berend/C. Frougny: Computability by finite automata and Pisot bases. Math. Systems Theory 27 (1994), 275-282. 24588 Jean Berstel: Transductions and context-free languages. Teubner 1979, 140p. 10511 Jean Berstel: Une hierarchie des parties rationelles de N^2. Math. Systems Th. 7 (1973), 114-137. 7871 Jean Berstel: Recent results in Sturmian words. Internet 1995, 12p. 7872 Jean Berstel: Axel Thue's work on repetitions in words. Internet 1995, 16p. 24566 Jean Berstel: Axel Thue's papers on repetitions in words - a translation. Internet 1994, 83p. 24565 Jean Berstel/L. Boisson: Towards an algebraic theory of context-free languages. Fund. Inform. 25 (1996), 217-239. Jean Berstel/D. Perrin: Theory of codes. Academic Press 1985. 0-12-093420-5. Pds. 82. 1129 Jean Berstel/Christophe Reutenauer: Rational series and their languages. Springer 1988. E. Blum: Free subsemigroups of a free semigroup. Mich. Math. J. 12 (1965), 179-182. 1105 Ronald Book (ed.): Formal language theory. Academic Press 1980. Ronald Book: The base of the intersection of two free submonoids. Discr. Appl. Math. 12 (1985), 13-20. Ronald Book/F. Otto: String-rewriting systems. Springer 1993, 190p. 3-540-97965-4. $39. 7924 Bernd Borchert: On the acceptance power of regular languages. Forschungsberichte Math. Logik Heidelberg 6 (1994). Wilfried Brauer: Automatentheorie. Teubner 1984, 490p. 3-519-02251-6. DM 62. 7911 Veronique Bruyere: Automata and numeration systems. Internet ca. 1996, 19p. Janusz Brzozowski: A survey of regular expressions and their applications. IRE Trans. El. Comp. 11/3 (1962), 324-335. Janusz Brzozowski: Derivatives of regular expressions. J. ACM 11/4 (1964), 481-494. 1116 Janusz Brzozowski: Open problems about regular languages. In 1105 Book, 23-47. R. Bukharaev: Theorie der stochastischen Automaten. Teubner 1995, 370p. 3-519-02124-2. DM 50. T. Chien: Decomposition of a free monoid into disjunctive languages. Soochow J. Math. 5 (1979), 121-127. 10667 C. Choffrut: On some combinatorial properties of metrics over the free monoid. In 10666 Cummings, 247-255. Noam Chomsky: Three models for the description of language. IRE Trans. Information theory 2 (1956), 113-124. Noam Chomsky: On certain formal properties of grammars. Information and control 2 (1959), 137-167. Noam Chomsky/G. Miller: Finite state languages. Information and control 1 (1958), 91-112. 22804 Noam Chomsky/Marcel Schützenberger: The algebraic theory of context-free languages. In P. Braffort/D. Hirschberg (ed.): Computer programming and formal systems. North-Holland 1963, 118-161. G. Christol/T. Kamae/M. Mendes-France/G. Rauzy: Suite algebriques, automates et substitutions. Bull. Soc. Math. France 108 (1980), 401-419. 3353 A. Clifford/G. Preston: The algebraic theory of semigroups. 2 volumes. AMS 1961. P. Cohn: On subsemigroups of free semigroups. Proc. AMS 63 (1962), 347-351. J. Conway: Regular algebra and finite machines. Chapman & Hall 1971. 10666 Larry Cummings (ed.): Combinatorics on words. Academic Press 1983. 10723 Maylis Delest: Algebraic languages - a bridge between combinatorics and computer science. Internet ca. 1996, 17p. 10670 A. De Luca/L. Ricciardi: Introduzione alla cibernetica. Franco Angeli 1971. Aldo De Luca/Stefano Varricchio: Well quasi-orders and regular languages. Acta Informatica 31 (1994), 539-557. 24361 Aldo De Luca/Flavio D'Alessandro: Teoria degli automi finiti. Springer 2013, 320p. Eur 27. 1115 Peter Deussen: Halbgruppen und Automaten. Springer 1971. 14387 Volker Diekert/Yuji Kobayashi: Some identities related to automata, determinants, and Mo''bius functions. Internet 1997, 23p. 1067 Hartmut Ehrig/Klaus-Dieter Kiermeier/Hans-Joerg Kreowski/Wolfgang Kuehnel: Universal theory of automata. Teubner 1974. 1103 Samuel Eilenberg: Automata, languages, and machines A. Academic Press 1974. 1104 Samuel Eilenberg: Automata, languages, and machines B. Academic Press 1974. 26131 Zoltan Esik/Werner Kuich: Modern automata theory. Internet ca. 2005, 220p. 25489 Javier Esparza: Automata theory. Internet (preliminary version) 2012, 280p. 2743 Daniela Gambi: Sistemi di Lindenmayer e automi cellulari. Tesi, Ferrara 1991. 8296 Robert Gilman: A shrinking lemma for indexed languages. Internet, ca. 1995, 5p. 8294 Robert Gilman: Formal languages and infinite groups. Internet, ca. 1996, 25p. 1123 Seymour Ginsburg: Lectures on context-free languages. In 1112 Arbib, 313-327. Seymour Ginsburg: Algebraic and automata-theoretic properties of formal languages. North-Holland 1975. 1108 Seymour Ginsburg: Methods for specifying families of formal languages - past, present, future. In 1105 Book, 1-22. 1106 Jonathan Goldstine: Formal languages and their relation to automata - what Hopcroft & Ullman didn't tell us. In 1105 Book, 109-140. 1076 Maurice Gross/Andre' Lentin: Mathematische Linguistik. Springer 1971. 17545 I. Grunskii/V. Koslovskii: Sintez i identifikatsia avtomatov. Naukova Dymka Kiev 2004, 240p. 1766 Michael Harrison: Introduction to formal language theory. Addison-Wesley 1978. U. Hebisch/Hanns Weinert: Halbringe. Algebraische Theorie und Anwendungen in der Informatik. Teubner 1993, 360p. 3-519-02091-2. DM 43. Ulrich Hedtstu''ck: Formale Sprachen und Automatentheorie. 2000. Eur 20. Wolfgang Herfort/Werner Kuich: Semitopological semirings and pushdown automata. Math. Systems Theory 17 (1984), 279-291. The paper gives a characterization of algebraic power series over a commutative semiring in terms of pushdown automata. 1170 John Hopcroft/Jeffrey Ullman: Einfuehrung in die Automatentheorie, formale Sprachen und Komplexitaetstheorie. Addison-Wesley 1989. 1092 Guenter Hotz/Klaus Estenfeld: Formale Sprachen. Bibl. Inst. 1981. G. Hotz/H. Walter: Automatentheorie und formale Sprachen II. Endliche Automaten. Bibl. Inst. 1969. 8565 Howie: Automata and languages. Oxford UP 1991, 300p. 0-19-853442-6. Pds. 15. 18851 Masami Ito/Jürgen Dassow/Ralf Stiebe: Some remarks on codes defined by Petri nets. J. Univ. Comp. Sci. 8/2 (2002), 260-269. Dean Kelley: Automata and formal languages. Prentice Hall 2000, 350p. $49. 25508 Bakhadyr Khoussainov/Anil Nerode: Automata theory and its applications. Birkhäuser 2001, 430p. Eur 80. "This is a self-contained book on automata theory suitable for a two-semester course for computer science or mathematics majors ... There is no doubt that this book will make the beautiful theory of automata available to a larger audience in a very successful way." (H. Mitsch) S. Kleene: Representation of events in nerve nets and finite automata. In Shannon/McCarthy 1956, 3-42. 1150 N. Kobrinski/B. Trachtenbrot: Einfuehrung in die Theorie endlicher Automaten. Akademie-Verlag 1967. 7215 Roman Koenig: Lectures on codes. 1994. 16998 Zvi Kohavi: Switching and finite automata theory. McGraw-Hill 20003, 660p. $52. 1111 Werner Kuich/Arto Salomaa: Semirings, automata, languages. Springer 1986. 23110 Yves Lafont: Algebra and geometry of rewriting. Internet 2006, 16p. M. Lawson: Finite automata. Chapman & Hall 2003, 310p. $70. J. van Leeuwen (ed.): Handbook of theoretical computer science - volume B. Elsevier 1990. F. Levi: On semigroups. Bull. Calcutta Math. Soc. 36 (1944), 141-146. 9768 Nathalie Loraud: beta-shift, systemes de numeration et automates. J. Theorie des Nombres Bordeaux 7 (1995), 473-498. 1767 M. Lothaire (a group of authors): Combinatorics on words. Addison-Wesley 1983, 230p. 0-521-30237-4. 10471 M. Lothaire: Words. First chapter of the new edition of "Combinatorics on words." Internet 1997, 17p. M. Lothaire: Algebraic combinatorics on words. Ca. 1998. 10467 M. Lothaire: Presentation of the book "Algebraic combinatorics on words". Internet 1997, 18p. M. Marcotty/H. Ledgard: The world of programming languages. Springer 1987. H. Maurer: Theoretische Grundlagen der Programmiersprachen. Bibl. Inst. 1977. 11595 Robert McNaughton: Semi-Thue systems with an inhibitor. Internet 1998, 27p. Robert McNaughton/H. Yamada: Regular expressions and state graphs for automata. IRE Trans. El. Comp. 9/1 (1960), 39-47. Marvin Minsky: Computation. Finite and infinite machines. Prentice Hall 1967. Eckart Modrow: Automaten, Schaltwerke, Sprachen. Du''mmler 1992, 210p. DM 34. 11591 A. Paradis/G. Thierrin: Languages of primitive words associated with sets of natural numbers. In 2831 Hofmann/, 404-411. Dominique Perrin: Finite automata. In Leeuwen 1990, 1-57. 14428 Dominique Perrin: Les de'buts de la the'orie des automates. Internet ca. 1994, 26p. Dominique Perrin/Jean-Eric Pin: Mots infinis. Ca. 1999. 1417 Jean-Eric Pin: Varietes de langages formels. Masson 1984. 2562 Jean-Eric Pin: Topologies for the free monoid. J. Algebra 137 (1991), 297-337. B. Plotkin/L. Greenglaz/A.Gvaramija: Algebraic structures in automata and database theory. World Scientific 1992, 300p. 981-02.0936-3. $61. M. Rabin/D. Scott: Finite automata and their decision problems. IBM J. Res. Dev. 3/2 (1959), 115-125. C. Reis/H. Shyr: Some properties of disjunctive languages on a free monoid. Inf. and Control 37 (1978), 334-344. Gyorgy Revesz: Introduction to formal languages. Dover, 200p. $10. G. Rozenberg/Arto Salomaa: Handbook of formal languages. 3 volumes. Springer 1997, tog. 2100p. 3-540-61486-9. Tog. DM 348. 25507 Jacques Sakarovitch: Elements of automata theory. Cambridge UP 2009, 760p. Eur 145. Very comprehensive and mathematically written. 25 Arto Salomaa: Formale Sprachen. Springer 1978. 1117 Arto Salomaa: Morphisms on free monoids and language theory. In 1105 Book, 141-166. 1130 Arto Salomaa/Matti Soittola: Automata-theoretic aspects of formal power series. Springer 1978. Peter Sander/Wolffried Stucky/Rudolf Herschel: Automaten, Sprachen, Berechenbarkeit. Teubner 1995, 270p. 3-519-12937-X. DM 36. 11498 Jeffrey Shallit: Automaticity. A talk. Internet ca. 1997, 31p. 1124 Eliahu Shamir: Algebraic, rational, and context-free power series in noncommuting variables. In 1112 Arbib, 329-341. Claude Shannon/J. McCarthy (ed.): Automata studies. Princeton UP 1956. H. Shyr: Disjunctive languages on a free monoid. Inf. and Control 34 (1977), 123-129. H. Shyr: Free monoids and languages. LN Soochow Univ. Taipei 1979. H. Shyr/G. Thierrin: Disjunctive languages and codes. Springer LN CS 56 (1977), 171-176. Thomas Sudkamp: Languages and machines. Addison-Wesley 1996, 570p. $107. W. Thomas: Automata on infinite objects. In Leeuwen 1990, 135-191. B. Tilson: The intersection of free submonoids of free monoids is free. Semigroup Forum 4 (1972), 345-350. 24636 Christian Wagenknecht/Michael Hielscher: Formale Sprachen, abstrakte Automaten und Compiler. Teubner 2009, 260p. Eur 23 (Ebuch). 7961 Ingo Wegener: Theoretische Informatik. Teubner 1993, 240p. 3-519-02123-4. DM 34. 7909 H. Zeiger: Cascade decomposition of automata using covers. In 1112 Arbib, 55-80.