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?

- ServerfaultXchanger
- SuperuserXchanger
- UbuntuXchanger
- WebappsXchanger
- WebmastersXchanger
- ProgrammersXchanger
- DbaXchanger
- DrupalXchanger
- WordpressXchanger
- MagentoXchanger
- JoomlaXchanger
- AndroidXchanger
- AppleXchanger
- GameXchanger
- GamingXchanger
- BlenderXchanger
- UxXchanger
- CookingXchanger
- PhotoXchanger
- StatsXchanger
- MathXchanger
- DiyXchanger
- GisXchanger
- TexXchanger
- MetaXchanger
- ElectronicsXchanger
- StackoverflowXchanger
- BitcoinXchanger
- EthereumXcanger