References

  1. A. de Luca and A. Restivo (1980): A Characterization of Strictly Locally Testable Languages and Its Applications to Subsemigroups of a Free Semigroup. Information and Control 44(3), pp. 300–319.
  2. J. Berstel & J.E. Pin (1996): Local Languages and the Berry-Sethi Algorithm. Theor. Comput. Sci. 155(2), pp. 439–446, doi:10.1016/0304-3975(95)00104-2.
  3. V. Braitenberg (2004): Das Bild der Welt im Kopf: Eine Naturgeschichte des Geistes. LIT Verlag, Muenster.
  4. P. Caron (2000): Families of locally testable languages. Theor. Comput. Sci. 242(1-2), pp. 361–376, doi:10.1016/S0304-3975(98)00332-6.
  5. S. Crespi Reghizzi & Pierluigi San Pietro (2011): Consensual languages and matching finite-state computations. RAIRO Theor. Informatics and Appl. 45, pp. 77–97.
  6. L.E. Dickson (1919): History of the Theory of Numbers. Carnegie Institution of Washington, Online version at: http://www.archive.org/details/historyoftheoryo01dick.
  7. P. Garcia & E. Vidal (1990): Inference of K-Testable Languages in the Strict Sense and Application to Syntactic Pattern Recognition. IEEE Trans. Pattern Analysis and Machine Intelligence 12(9), pp. 920–925, doi:10.1109/34.57687.
  8. D. Giammarresi & A. Restivo (1997): Two-dimensional languages. In: G. Rozenberg & A. Salomaa: Handbook of formal languages, vol. 3: beyond words. Springer-Verlag New York, Inc., New York, NY, USA, pp. 215–267.
  9. T. Head (1987): Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors. Bulletin of Mathematical Biology 49, pp. 737–759, doi:10.1007/BF02481771.
  10. J. Rogers and G. Pullum (2011): Aural pattern recognition experiments and the subregular hierarchy. Journ. of Logic Language and Information to appear.
  11. R. McNaughton & S. Papert (1971): Counter-free Automata. MIT Press, Cambridge, USA.
  12. Y. T. Medvedev (1964): On the class of events representable in a finite automaton. In: E. F. Moore: Sequential machines – Selected papers (translated from Russian). Addison-Wesley, New York, NY, USA, pp. 215–227.
  13. S. Eilenberg (1974): Automata, Languages, and Machines. Academic Press.
  14. W. A. Wickelgren (1969): Context-sensitive coding, associative memory and serial order in (speech) behavior. Psychological Review 76(1), doi:10.1037/h0026823.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org