Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

1 . [ 5 marks ] Let Sigma = { a , b } . Consider the following languages LA and LB over

1.[5 marks] Let \Sigma ={a, b}. Consider the following languages LA and LB over \Sigma :
LA ={w in \Sigma | w contains an even number of occurrences of symbol a}
LB ={w in \Sigma | each pair of consecutive bs in w is separated by a substring of as of length 2i, i >=0}
Clarification: LB is saying that between bs there must be 2i as for some i >=0(e.g. baab in LB
and baaab / in LB ). Also, i must be an integer value >=0.
For each of the following strings, decide whether it is a member of LA or LB :
(a) b
(b) aabbbbaa
(c) abaaabaaa
(d) bbaaaabbaab
(e) a

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Intelligent Databases Object Oriented Deductive Hypermedia Technologies

Authors: Kamran Parsaye, Mark Chignell, Setrag Khoshafian, Harry Wong

1st Edition

0471503452, 978-0471503453

More Books

Students also viewed these Databases questions

Question

How might a countrys culture be a barrier to global business?

Answered: 1 week ago