Trivial languages
Only these two languages are called trivial
- No strings are accepted (language is empty)
- All strings are accepted
How to prove non-triviality
- Find one string that IS in the language AND
- Find one string that IS NOT in the language
Select a result to preview
Only these two languages are called trivial