J. Almeida a.o. (ed.): Semigroups, languages, automata. World Scientific 1996. 7904 Michael Arbib: Automaton decompositions and semigroup extensions. In 1112 Arbib, 37-54. 1112 Michael Arbib: Algebraic theory of machines, languages, and semigroups. Academic Press 1968. 7906 Michael Arbib/John Rhodes/Bret Tilson: Complexity and group complexity of finite-state machines and finite semigroups. In 1112 Arbib, 127-145. 7903 E. Assmus/J. Florentin: Algebraic machine theory and logical design. In 1112 Arbib, 15-35. 15424 D. Paul Benjamin: Formulating domain theories for software design. Internet ca. 1995, 6p. 15425 D. Paul Benjamin: Decomposing robotic representations by finding local symmetries and invariants. Internet ca 1997, 2p. Jean Berstel/Dominique Perrin: Theory of codes. Academic Press 1985. 0-12-093420-5. Pds. 82. 9737 Jean Berstel/Dominique Perrin: Theory of codes. Preliminary version of the new edition. Internet 1996. 15423 Joelle Cohen/Dominique Perrin/Jean-Eric Pin: On the expressive power of temporal logic. Internet 1991, 22p. 24624 P. Cohn: Review of the book "Semigroups and combinatorial applications" by Gerard Lallement. Bull. AMS 2/3 (1980), 483-485. 14226 Aldo De Luca/Stefano Varricchio: Finiteness and regularity in semigroups and formal languages. Springer 1999, 240p. $45. 24625 Volker Diekert/Manfred Kufleitner/Benjamin Steinberg: The Krohn-Rhodes theorem and local divisors. Internet 2011, 14p. 24629 Volker Diekert/Anca Muscholl: Trace theory. Internet 2011, 16p. 1103 Samuel Eilenberg: Automata, languages, and machines A-B. Academic Press 1974. 7866 Karl Folley (ed.): Semigroups. Academic Press 1969. J. Fountain (ed.): Semigroups, formal languages and groups. Kluwer 1995. J. Fox (ed.): Proc. Symp. Math. Theory of Automata. Polytechn. Inst. Brooklyn 1962. Andrew Gleason: Semigroups of shift register matrices. Math. Systems Theory 25 (1992), 253-267. From a course given at Princeton in 1960. 24579 Tero Harju/Juhani Karhumäki: Morphisms. In Rozenberg/Salomaa (ed.): Handbook of formal languages. Springer 1997, 439-510. Joxan Jaffar: Minimal and complete word unification. J. ACM 37/1 (1990), 47-85. 11592 Helmut Jürgensen: Total disjunktive verallgemeinerte Bruck-Reilly- Erweiterungen von Halbgruppen und formale Sprachen. In 2831 Hofmann/Ju''rgensen/Weinert, 281-309. 16897 Mati Kilp/Ulrich Knauer/Alexander Mikhalev: Monoids, acts and categories. De Gruyter 2000, 530p. $149. 25432 Yuji Kobayashi: Note on compatible well orders on a free monoid. Semigroup Forum 45 (1992), 23-25. 25433 Yuji Kobayashi: Well-ordered monoids - two numerical functions. Internet 2004, 10p. 7215 Roman Koenig: Lectures on codes. 1994. Kenneth Krohn/R. Langer/John Rhodes: Algebraic principles for the analysis of a biochemical system. J. Comp. Syst. Sci. 1 (1967), 119-136. 10563 Kenneth Krohn/Richard Mateosian/John Rhodes: Complexity of ideals in finite semigroups and finite-state machines. Math. Systems Theory 1 (1967), 59-66. Kenneth Krohn/John Rhodes: Algebraic theory of machines. In Fox 1962, 341-384. Kenneth Krohn/John Rhodes: Results on finite semigroups derived from the algebraic theory of machines. Proc. Nat. Ac. Sci. USA 53 (1965), 499-501. 7886 Kenneth Krohn/John Rhodes: Algebraic theory of machines I. Prime decomposition theorem for finite semigroups and machines. Trans. AMS 116 (1965), 450-464. 7912 Kenneth Krohn/John Rhodes: Complexity of finite semigroups. Annals Math. 88 (1968), 128-160. 7905 Kenneth Krohn/John Rhodes/Bret Tilson: The prime decomposition theorem of the algebraic theory of machines. In 1112 Arbib, 81-125. 7907 Kenneth Krohn/John Rhodes/Bret Tilson: Axioms for complexity of finite semigroups. In 1112 Arbib, 233-267. 10058 Gerard Lallement: Semigroups and combinatorial applications. Wiley 1979. G. Makanin: The problem of solvability of equations on a free semigroup. Math. USSR Sbornik 32/2 (1977), ... 7890 Stuart Margolis/John Meakin: Inverse monoids, trees and context free languages. Trans. AMS 335 (1993), 259-273. 7870 Stuart Margolis/John Meakin/Mark Sapir: Algorithmic problems in groups, semigroups and inverse semigroups. In Fountain 1995, 147-214. Stuart Margolis/J. Pin: New results on the conjecture of Rhodes and on the topological conjecture. J. Pure Appl. Algebra 80 (1992), 305-313. W. Maurer: On minimal decompositions of group machines. PhD Thesis, Univ. Calif. Berkeley, 1965. 11599 Robert McNaughton: The finiteness of finitely presented monoids. Internet 1997, 15p. 1122 Robert McNaughton/Seymour Papert: The syntactic monoid of a regular event. In 1112 Arbib, 297-312. Marston Morse/G. Hedlund: Unending chess, symbolic dynamics and a problem in semigroups. Duke Math. J. 11 (1944), 1-15. Chrystopher Nehaniv: Complexity of finite aperiodic semigroups and star-free languages. In Almeida a.o. 1996, 195-209. 24623 Dominique Perrin/Jean-Eric Pin: Semigroups and automata on infinite words. Internet 1995, 28p. John Rhodes: Some results in finite semigroups. J. Algebra 4 (1966), 471-504. 7867 John Rhodes: Algebraic theory of finite semigroups. In 7866 Folley, 125-162. John Rhodes: A homomorphism theorem for finite semigroups. J. Math. Syst. Theory 1 (1967), 289-304. John Rhodes: Complexity and characters of finite semigroups. J. Comb. Theory, ca. 1968. John Rhodes: The fundamental lemma of complexity for arbitrary finite semigroups. Bull. AMS 74 (1968), 1104-1109. Carla Selmi: Strongly locally testable semigroups with commuting idempotents and related languages. RAIRO Theor. Info. Appl. 33 (1996), 47-57. 11539 Jeffrey Shallit: Formal languages and number theory - course project. Internet 1998, 4p. Very good problem collection. 7868 Bret Tilson: Appendix to "Algebraic theory of finite semigroups". On the p length of p-solvable semigroups. Preliminary results. In 7866 Folley, 163-208. Stefano Varricchio: Rational series with coefficients in a commutative ring. Theor. Comp. Sci. 98 (1992), 291-299.