- ADFA = {< D, w > | D is a DFA that accepts input w}
By Simulatation - ANFA = {< N, w > | N is an NFA that accepts input w}
Convert to DFA - AREX = {< R, w > | R is a regular expression that generates w}
Convert to DFA - MINDFA = {< D > | D is a minimal DFA}
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> | |
<html> | |
<head> | |
<meta http-equiv="content-type" content="text/html; charset=utf-8"> | |
</head> | |
<body> | |
<h1>Decidable</h1> | |
<h2>DFA NFA Regular Expression</h2> | |
<ol> | |
<li>A<sub>DFA</sub> = {< D, w > | D is a DFA that accepts input w}<blockquote> |