the regular expression for the b)
the transitions for b)
here i take states are:
s0,s1,s2
s0->final state
s1,s2 are intermediate or kill states
transitions:
s0=a>s1
s0=b>s2
s1=a>s0
s1=b>s0
s2=b>s1
regular expression:
e->episilon or empty string
e+(a+bb)(ab)b+(e+(a+bb)(ab)*b)((a+bb)(ab)*b)(e+(a+bb)(ab)*b)
for c:
regular expression:
(b+(a+e)a*b)(a+(b+ab)(ab)*(a+e+ab)+b+ab)+b+(a+e)a*b
#if you have any doubts comment below..
Find regular expressions for the languages accepted by the following automata(b and c) (b) (c)
Find regular expressions for the languages accepted by the following automata.
Find regular expressions for the languages accepted by the following automata.
Find regular expression for the language accepted by the following automata. Find regular expression for the language accepted by the following automata. gl a b q2 q0
2. Properties of the following: (a) Regular languages (b) Context-free languages (c) Regular expressions (d) Non-deterministic finite automaton (e) Turing-recognizable and Turing-decidable languages (f) A <m B and what we can then determine (g) A <p B and what we can then determine (h) NP-hard and NP-complete.
Find a regular expression for the language accepted by the following automata q0 q1 q3
(a, b): 3. Construct (draw) finite automata for the following regular expressions over the alphabet ? (b) a'b
Question 1 - Regular Expressions Find regular expressions that define the following languages: 1. All even-length strings over the alphabet {a,b}. 2. All strings over the alphabet {a,b} with odd numbers of a's. 3. All strings over the alphabet {a,b} with even numbers of b’s. 4. All strings over the alphabet {a,b} that start and end with different symbols. 5. All strings over the alphabet {a, b} that do not contain the substring aab and end with bb.
True or False The following two regular expressions represent different languages (a+aa)(a+b)* and a(a+b)*
Regular expressions, DFA, NFA, grammars, languages Regular Languages 4 4 1. Write English descriptions for the languages generated by the following regular expressions: (a) (01... 9|A|B|C|D|E|F)+(2X) (b) (ab)*(a|ble) 2. Write regular expressions for each of the following. (a) All strings of lowercase letters that begin and end in a. (b) All strings of digits that contain no leading zeros. (c) All strings of digits that represent even numbers. (d) Strings over the alphabet {a,b,c} with an even number of a's....
give the regular expressions for each of the following languages u.{xy {a, b}* | the number of as in x is odd and the number of bs in y is even}