Scoring tennis using finite-state automata
See the original posting on DZone Python
For some reason having to do with the medieval French, the scoring system for tennis is very strange.
For some reason, the scoring system for tennis is very strange. Fortunately, the convoluted logic is easy to express as a finite-state automaton (FSA). If you build this Automaton in Lucene and minimize it, you'll discover that…