Question

etermine whether or not the following languages are regu- lar. If the language is regular then give an NFA or regular expression for the language. Otherwise, use the pumping lemma for regular languages or closure properties to prove the language is not regular L = {bnak : n > 0, k > 0} ∪ {anbk : k > 0, n > 0}

Name: etermine whether or not the following languages are regu lar if the language is regular then give an nfa or regular expression for the language otherwise use the pumping lemma for regular la 49105
Uploaded: 2021-11-19T07:03:20-08:00
Duration: 3 min 9 s
Channel: Vaidik Stats
Description: etermine whether or not the following languages are regu lar if the language is regular then give an nfa or regular expression for the language otherwise use the pumping lemma for regular la 49105

          etermine whether or not the following languages are regu-
lar. If the language is regular then give an NFA or regular expression for
the language. Otherwise, use the pumping lemma for regular languages
or closure properties to prove the language is not regular
L = {bnak : n > 0, k > 0} ∪ {anbk : k > 0, n > 0}

Added by Stephanie H.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Vaidik Stats

11/19/2021

Step 1

The language L is defined as: \[ L = \{ b^n a^k : n > 0, k > 0 \} \cup \{ a^n b^k : n > 0, k > 0 \} \] This means L consists of two parts: 1. Strings that start with one or more 'b's followed by one or more 'a's. 2. Strings that start with one or more 'a's Show more…

Show all steps

Thanks for your feedback!

etermine whether or not the following languages are regu- lar. If the language is regular then give an NFA or regular expression for the language. Otherwise, use the pumping lemma for regular languages or closure properties to prove the language is not regular L = {bnak : n > 0, k > 0} ∪ {anbk : k > 0, n > 0}