regular expression describe the language { w belongs to {a,b}* :  na(w)=3k for k>=0}

EBK JAVA PROGRAMMING
8th Edition
ISBN:9781305480537
Author:FARRELL
Publisher:FARRELL
Chapter2: Using Data
Section: Chapter Questions
Problem 2PE
icon
Related questions
Question

which of the following regular expression describe the language { w belongs to {a,b}* :  na(w)=3k for k>=0}

a is wriiten on the base of n like log 10 base a?? 

options a) (aaa+b)*

option b) (b+a+b+a+b+a+b)*

option c) ((aaa)* + b*ab*ab*ab*)*

option d) (aaa+b+aaab+aaba+abaa+baaa)*

please explain

Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Binary numbers
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781305480537
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT