page_title: DFA minimization
hierarchical_section_title: DFA minimization
caption_attribution_description: English: A minimized deterministic finite state automaton, obtained from File:DFA to be minimized.jpg. Ελληνικά: Ένα ελαχιστοποιημένο ντετερμινιστικό πεπερασμένο αυτόματο. Italiano: L'automa a stati finiti deterministico dell'immagine File:DFA to be minimized.jpg dopo il processo di minimizzazione
context_page_description: In automata theory, DFA minimization is the task of transforming a given deterministic finite automaton into an equivalent DFA that has a minimum number of states. Here, two DFAs are called equivalent if they recognize the same regular language. Several different algorithms accomplishing this task are known and described in standard textbooks on automata theory.
context_section_description: In automata theory (a branch of theoretical computer science), DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states. Here, two DFAs are called equivalent if they recognize the same regular language. Several different algorithms accomplishing this task are known and described in standard textbooks on automata theory.
caption: Equivalent minimal DFA. Nondistinguishable states have been joined into a single one.
exif: {"Image Orientation": "Horizontal (normal)", "Image XResolution": "72", "Image YResolution": "72", "Image ResolutionUnit": "Pixels/Inch", "Image Software": "Adobe Photoshop CS2 Windows", "Image DateTime": "2009:04:22 21:30:44", "Image ExifOffset": "164", "Thumbnail Compression": "JPEG (old-style)", "Thumbnail XResolution": "72", "Thumbnail YResolution": "72", "Thumbnail ResolutionUnit": "Pixels/Inch", "Thumbnail JPEGInterchangeFormat": "302", "Thumbnail JPEGInterchangeFormatLength": "2201", "EXIF ColorSpace": "Uncalibrated", "EXIF ExifImageWidth": "585", "EXIF ExifImageLength": "118"}