Let A be a regular language, B = A*, and C = A o B. In each case, argue briefly why.
a) Is A = B?
b) Is B = C?
c) Is C = A?
Solution
No
because B includes e.g. an empty string which may not be in A
---
In general, no.
Only if an empty string belongs to A
--
No
Similar as a), i.e., no.
because A includes e.g. an empty string which may not be in C
---
all the best
Let A={a,b,c}. Describe the language L(r) for each of the following regular expressions: (a) rFab*c; (b)r=(abuc)*; (c) r=abuc*.
Let L be a regular language on sigma = {a, b, d, e}. Let L' be the set of strings in L that contain the substring aab. Show that L' is a regular language.
Let be a, b, c} and let M be the language over 2 determined by the regular expression E a*bbc*. Construct an automaton (DFA) that recognises (accepts)
4.[10 points] Let A be the language over the alphabet E-(a, b} defined by regular expression (ab U b)*a U b. Give an NFA that recognizes A. Draw an NFA for A here. 4.[10 points] Let A be the language over the alphabet E-(a, b} defined by regular expression (ab U b)*a U b. Give an NFA that recognizes A. Draw an NFA for A here.
4(10 points] Let A be the language over the alphabet -(a, b) defined by regular expression (ab Ub)aUb. Give an NFA that recognizes A. Draw an NFA for A here 5.10 points] Convert the following NFA to equivalent DFA a, b 4(10 points] Let A be the language over the alphabet -(a, b) defined by regular expression (ab Ub)aUb. Give an NFA that recognizes A. Draw an NFA for A here 5.10 points] Convert the following NFA to equivalent DFA...
(complexity): prove: if A is a Regular language then A∈DSPACE(O(1)) explanation:prove that the complexity class of a regular languages is DSPACE(O(1))
(4) [20 pts] Let L be the language defined by a regular expression (O | 1)0+(01 1)). over t alphabet f(o,1, +) (a) (4pt) Write down 5 different words from L (b) (8pt) Describe L using words. (c) (8pt) Draw an automaton accepting L (ideally, deterministic). (4) [20 pts] Let L be the language defined by a regular expression (O | 1)0+(01 1)). over t alphabet f(o,1, +) (a) (4pt) Write down 5 different words from L (b) (8pt) Describe...
Question 9. Consider the language {a"b" : n >0}. (i) Is this a regular language? Why or why not? (ii) Is this a recursively enumerable language? Why or why not? Question 10. Consider the function defined by f(n) = 2 where n is a positive integer. (i) Can this function be computed by a Turing machine? Why or why not? (ii) Is this function primitive recursive? Why or why not?
1/ Assume that A and B are regular language, then prove that i/ (AUB) a regular language ii/ ( A and B) a regular language iii/ A concatenate B a regular language
The grammartofsm algorithm: Let L be the language described by the following regular grammar: a. For each of the following strings, indicate whether it is a member of L: v. zyyzz b. Use grammartofsm (Rich 2008; page 157) to construct an FSM that accepts L c. Give a concise (but complete) description of L in plain English. We were unable to transcribe this image