0
How many strings of length less than 4 contains the language described by the regular expression (x y)y(a ab)?
Wiki User
∙ 8y agoWant this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
What is relation between regular languages finite automaton and regular grammars?
finite automaton is the graphical representation of language and regular grammar is the representation of language in expressions
What poygon is a regular polygon?
A polygon is described as "regular" if all its sides have the same length. (It will also turn out that all of its angles are equal.)
What is a regular expression in PHP?
echo or print < both of which write text: <?php echo "TEXT"; print "TEXT"; ?>
Kyle has been keeping his eye on a sound system that costs x dollars. The system goes on sale for 15 off the regular price. Which expression can Kyle use to find the sale price?
Regular price - 15 = sale price
What does misty mean in the bible?
Words in the Bible generally have their regular meaning as defined in any regular dictionary of language. There are no widely distributed English translations that use the word "misty". The word "mist" occurs in a number of places, where it has its regular meaning of visible water vapour.
What is better Finite Automata or Regular Expression?
Finite Automata and Regular Expressions are equivalent. Any language that can be represented with a regular expression can be accepted by some finite automaton, and any language accepted by some finite automaton can be represented by a regular expression.
What is difference between regular expression and regular definition in compiler?
Regular expression is built in and the regular definition has to build from regular expression........
What is regular grammar of a for loops C programming language?
Something like this:statement -> for (opt_expression; opt_expression; opt_expression) statementstatement -> while (expression) statementstatement -> do statement while (expression);opt_expression -> | expression
Why do regular expressions have not enough power to express syntax of programming languages?
Because programming languages contain recursive structure, which cannot be represented by a regular expression.To give an example, most computer programs will have arithmetic expressions with matched parentheses:E --> FE --> E operator FF --> numberF --> lparen E rparenThis very simple grammar cannot be represented by a regular expression.Proof:Suppose that there were a regular expression for a language of matched parentheses. Let the length of the regular expression be m. Consider the string (m+1)m+1. This is in the language. Since the first half of the string is longer than the regular expression itself, it must avail of a star somewhere in the first half. Suppose this star was used to repeat n times a substring of length k. The same regular expression could be used to represent a similar string in which the substring of length k was repeated n+1 times. This means that the regular expression would also match the string (m+1+k)m+1 which is not in the language. Thus, the assumption that the language could be represented by a regular expression is false.
What is a regular expression?
In programming, a regular expression is an expression that explains a pattern for a string. A string matches a regular expression if that string follows the pattern of that regular expression. For example, you may want to create an account system, allowing usernames to only have uppercase and lowercase letters, and numbers. While a user is registering, you can check their desired username against a regular expression involving only alphanumeric characters (A-Z, a-z, 0-9). If it matches, then the username is valid to your requests. If it does not, the user has put in a character that does not follow the pattern of the regular expression. In regular expressions, you can match certain characters, match a certain quanity of characters, match the casing of characters (or just ignore it overall), and plenty more. The syntax of a regular expression varies throughout every programming language, but Perl is often used due to its wide variety of options. Perl is also incorporated into many web languages, such as PHP, making regular expressions less of a hassle. This is an example of a Perl regular expression, allowing a string with only alphanumeric characters (any character case), and an infinite length (except for a string with no length or no characters, in which the regular expression does not match the string): /^(?i)[a-z0-9]+$/
Is c is regular language?
it is not regular language .it is high level language
What is regular expressions?
In programming, a regular expression is an expression that explains a pattern for a string. A string matches a regular expression if that string follows the pattern of that regular expression. For example, you may want to create an account system, allowing usernames to only have uppercase and lowercase letters, and numbers. While a user is registering, you can check their desired username against a regular expression involving only alphanumeric characters (A-Z, a-z, 0-9). If it matches, then the username is valid to your requests. If it does not, the user has put in a character that does not follow the pattern of the regular expression. In regular expressions, you can match certain characters, match a certain quanity of characters, match the casing of characters (or just ignore it overall), and plenty more. The syntax of a regular expression varies throughout every programming language, but Perl is often used due to its wide variety of options. Perl is also incorporated into many web languages, such as PHP, making regular expressions less of a hassle. This is an example of a Perl regular expression, allowing a string with only alphanumeric characters (any character case), and an infinite length (except for a string with no length or no characters, in which the regular expression does not match the string): /^(?i)[a-z0-9]+$/
What is the application of regular expression in compiler construction?
Regular Expression is another way of implementing a lexical analyzer or scanner.
py4everybody regular expression answers autograde?
py4everybody regular expression answers auto grader chapter 11.2
What are regular expressions?
py4everybody regular expression answers autograde 11.2
Program for converting regular expression into NFA?
JFLAP
What is the period used for in a regular expression?
to stop a sentence
