Thursday, 14th January 2010 at 04:11

weekdays as modeled as Finite State Automata (FSA) and Minimal FSA (MFA).

via “Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, and Back”; Chapter 18 (ebook link)

tags: Finite State Automata String Processing Grammar Systems Minimal Finite State Automata Acyclic FSA
  1. dwbl reblogged this from dwblthnkr
  2. dwblthnkr posted this