The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes
Can aabbaabbbbbbbbaaaa  be generate by (a|b)*..


do we need to consider both a and b in language . we can generate any language with a and b ?
asked in Theory of Computation by (49 points) | 38 views

2 Answers

0 votes

yes, given string is generated by the language...

actually language L = set of all strings in the universe which are generated by a or b or both with including empty string.

                                = ∑* where ∑={a,b}

note that we can generate any string in the language by corresponding Regular Expression

but we can not generate any language by using single Regular Expression

even we can not generate some of the languages by using Regular Expressions

answered by Boss (31.3k points)
0 votes

Given expression (a|b)* can generate any string containing any whole number of a and b in any possible sequence. This includes an empty string. Therefore for this regular expression, we can generate any string, but not any language. Example: language anbn cannot be generated from the given expression, but any string from the language  anbn  can be generated from (a|b)*.

answered by (21 points)

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

40,853 questions
47,514 answers
62,274 users