@MISC{FLANG_1.MIZ,
  AUTHOR = {Trybulec, Micha{\l}},
  TITLE = {Formal Languages -- Concatenation and Closure},
  SECTION1 = {Preliminaries},
  SECTION2 = {Concatenation of Languages},
  SECTION3 = {n-th Power of a Language},
  SECTION4 = {Closure of a Language},
  SECTION5 = {Alphabet as a Language},
  DAY = {9},
  MONTH = {March},
  YEAR = {2007},
  ADDRESS1 = {Motorola Software Group},
  SUMMARY = {Formal languages are introduced as subsets of the set of all
  0-based finite sequences over a given set (the alphabet). Concatenation,
  the n-th power and closure are defined and their properties are shown.
  Finally, it is shown that the closure of the alphabet
  (understood here as the language of words of length 1)
  equals to the set of all words over that alphabet,
  and that the alphabet is the minimal set with this property.
  Bibliography: \cite{HOPCROFT-ULLMAN:1979} and \cite{WAITE-GOOS:1984}.}}

@BOOK{HOPCROFT-ULLMAN:1979,
 AUTHOR={John E. Hopcroft, Jeffrey D. Ullman},
 TITLE={Introduction to Automata Theory, Languages, and Computation},
 PUBLISHER={Addison-Wesley Publishing Company},
 YEAR=1979}

@BOOK{WAITE-GOOS:1984,
 AUTHOR={William M. Waite and Gerhard Goos},
 TITLE={Compiler Construction},
 PUBLISHER={Springer-Verlag New York Inc.},
 YEAR=1984}
