by Fox
Last Updated March 13, 2018 07:20 AM

I'm supposed to show that the following language is decidable:

{$\lt$A$\gt$ | A is a DFA and L(A) is not empty}

What I have

T = "On input $\lt$A$\gt$ where A is a DFA:

- Mark the start state of A
Repeat until no new states gets marked

`Mark any state that has a transition coming into it from any state that is already marked.`

- If an accept state is marked, accept. Otherwise reject.

Does this suffice to show that the language is decidable and did I make any mistakes?

- Serverfault Help
- Superuser Help
- Ubuntu Help
- Webapps Help
- Webmasters Help
- Programmers Help
- Dba Help
- Drupal Help
- Wordpress Help
- Magento Help
- Joomla Help
- Android Help
- Apple Help
- Game Help
- Gaming Help
- Blender Help
- Ux Help
- Cooking Help
- Photo Help
- Stats Help
- Math Help
- Diy Help
- Gis Help
- Tex Help
- Meta Help
- Electronics Help
- Stackoverflow Help
- Bitcoin Help
- Ethereum Help