L26: Minimizing the Number of States in a DFA

4,332 views · Published 13 December 2012 · 1:25:54 · Indexed 6 October 2026

Channel: UC Davis · 2012 · Science & Technology

Watch on YouTube

Completion of the method to minimize the number of states in a DFA for any regular language. A by-product is a proof that the minimizing DFA is unique for any given regular language.

More from this channel

• 3:40 Green Ideas:UC Davis students Think Locally for Focus the Nation

  UC Davis

  403 views · 5 March 2008

• 17:24 Building a connected campus

  UC Davis

  648 views · 22 April 2008

• 1:50 UC Davis Makes Award-Winning Olive Oil

  UC Davis

  787 views · 7 May 2008

• 3:02 Move Those Muscles

  UC Davis

  251 views · 23 June 2008

• 1:51 Wine Industry Hires Mid-Career Grads

  UC Davis

  983 views · 24 June 2008

• 1:50 New Feathers for a Heron

  UC Davis

  754 views · 25 June 2008

• 1:51 Tri-colored Blackbird in Trouble

  UC Davis

  393 views · 25 June 2008

• 1:50 Recycling Hook, Line and Sinker

  UC Davis

  674 views · 25 June 2008