Findings:

• bd (user)
• B&D
• Bd princess (user)
• BDS (user)
• bn (user)
• "a^n b^n" language
• pumping lemma proof that the "a^n b^n" language is not regular
• Myhill Theorem proof that the "a^n b^n" language is not regular
• BNS
• bn³ (user)

If you Log in you could create a "bD/betroit bN/bews" node. If you don't already have an account, you can register here.