Finite semigroups and recognizable languages : an introduction


This paper is an attempt to share with a larger audience some modern developments in the theory of finite automata. It is written for the mathematician who has a background in semigroup theory but knows next to nothing on automata and languages. No proofs are given, but the main results are illustrated by several examples and counterexamples. What is the… (More)

12 Figures and Tables


  • Presentations referencing similar topics