Hello, there, here are some language and expression of Theory of computation, I
ID: 3590097 • Letter: H
Question
Hello, there, here are some language and expression of Theory of computation, I wish you can answer all of them:
1. What is the language of this expression? (a U b)* (b U ba U baa) U l U a U aa considering the alphabet is S = {a, b}.
2. Do the following strings belong to this language? c*(b U ac*)* acabacc bbaaacc Explain your answer clearly and briefly.
3. Grammar, automaton, and regular expressions can be considered as a tool in the field of regular language. What is their role (functionality)? In other words, what does each one do for language?
4. In your own words and briefly, define expression graph.
5. Explain in simple English, what is the difference between these languages. In other words, what are the sets of strings of these expressions? (a U b)*b(a U b)*b (a U b)* and a*ba*ba*
7. Is regular expression definition of a language unique? If no, give an example.
8. Give the regular expression for the set of strings over {0, 1} that do not end in 111.
Explanation / Answer
1.The language of expression of
(a U b)* (b U ba U baa) U l U a U aa is context free grammar.
a is called the terminal symbol.
non-terminal symbol S can represent any string in the language.
S is the empty string
2. c*(b U ac*)*
false we did not get acabacc from the above expression.
bbaaacc from the above expression.
3,
according to computer science the regular language is
a formal language.
it can satisfy the regular grammar
the languaguage accepted by alternating finite automation.
the language accepted by read only turing machine
4.
Expression graph;
The diagram which can represent the system for connections
and interrelation among two or more thing with distinctive dots,lines or bars.
5(a U b)*b(a U b)*b (a U b)* it is a union expression and a*ba*ba* it is a concatenation expression
7, the regular expression is not a unique language
b^*(ab^+)^*Ub^*(ab^+)*a
=(bUab)*(lambda U a)
8.
The set of strings over {0,1} that that do not end in 111
The set of strings over {0,1} that do not end in 111
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.