Provide a regular expression that describes all bit-strings that length is at least one and at most three.
Solution :
Bit string means a string which contains number of bits either 0 or 1.

So the RE is ((0+1)+(0+1)(0+1))+(0+1)(0+1)+(0+1)
From first part we can get length 1 strings from second part we can get the strings of length two and from third part we can get the strings of length 3.Here + means take any one of them.
Note : if you have any queries please post a comment thanks a lot.. always available to help you
Provide a regular expression that describes all bit-strings that length is at least one and at...
****** Theory of Computing ********* 1. Provide a regular expression for “all even length strings of b’s”. 2. List all words of length 4 in Language((a+b)* a). Also, provide an English description of this language.
1. Use a Regular Expression to define the set of all bit strings
of one or more 0's followed by only a 1.
2. Use a Regular Expression to define the set of all bit string
of two or more symbols followed by three or more 0's.
3. Are these two grammars the same?
a. S-> aSb|ab|λ
b. S-> aAb|ab A->aAb|λ
4. Use the process of elimination to find the language of the
following FA: (see picture for diagram)
5....
Regular Expression of All strings of x y z with. At Most one x And At Most three y In the whole string
Provide a regular expression for the following languages: (a) the set of all strings over {a, b} that start with ab and end with ba, (b) the set of strings over {a, b} where four consecutive occurrences of both letters occur in every word.
Construct a regular expression that recognizes the following language of strings over the alphabet {0 1}: The language consisting of the set of all bit strings that contain two or three symbols.
Find all strings with length exactly 4 represented by the regular expression, a*bb*. Put your answers in alphabetical order separated by a single space and no commas.
Write a regular expression that captures the set of strings composed of 'a', 'b', and 'c', where any string uses at most two of the three letters (for example, "abbab" is a valid string, or "bccbb", or "ccacaa", but not "abccba": strings that contain only one of the three letters are also fine). Give a non-deterministic finite automaton that captures the regular expression from Using the construction described in class, give a deterministic version of the automaton. Repeat the previous...
Provide a regular expression for the set of strings over {a, b, c} such that the number of a’s equals the number of b’s and is less than or equal to 2.
Let A be the set of all bit strings of length 10. 1. How many bit strings of length 10 are there? How many bit strings of length 10 begin with 1101? How many bit strings of length 10 have exactly six 0's? How many bit strings of length 10 have equal numbers of O's and 1's? How many bit strings of length 10 have more O's than 1's? a. b. c. d. e.
Automata Theory Construct a regular expression for the set of bit strings in which every odd bit is 1. For example, these are in the language: 10 (OK: 1 in position 1) 111 (OK: 1 in positions 1 and 3) 10101 (OK: 1 in positions 1, 3, and 5) 101111 (OK: 1 in positions 1, 3, and 5) ϵ (OK: There are no odd positions) And these are not in the language: 0111 (BAD: position 1 is not a 1)...