Regular expression for dfa
0 likes71 views
The document discusses finite automata and regular expressions, noting that finite automata recognize string patterns while regular expressions generate them. It provides examples of operands in regular expressions like characters, variables, epsilon, and null. The document goes on to state that it will discuss converting finite automata to regular grammars. As an example, it defines a regular grammar R(G) for a given deterministic finite automaton (DFA) with nonterminal symbols Vn={A0, A1, A2, A3} and terminal alphabet ∑={a,b}, listing the production rules that define the grammar.
1 of 6
More Related Content
What's hot (20)
Ad
Similar to Regular expression for dfa (20)
Ad
More from Dr. ABHISHEK K PANDEY (20)
Recently uploaded (20)
Regular expression for dfa
- 1. Prof.Neeraj Bhargava Abhishek Kumar Department of Computer Science School of Engineering & System Sciences, MDS, University Ajmer, Rajasthan, India 1
- 2. • Finite automata are used to recognize patterns of strings, regular expression are used to generate patterns of strings. • A regular expression is an algebraic formula whose values is a pattern consisting of a set of strings, called the language of the expression. Operands in a regular expression can be: • Characters from the alphabet over which the regular expression is defined. • Variables whose values are any pattern defined by a regular expression. 2
- 3. • Epsilon which denotes the empty string containing no characters. • Null which denotes the empty set of string. In this section we will discuss finite automata, how to convert finite automata into regular grammar. 3
- 4. Que : Construct a regular grammar for given DFA. R(G)= { Vn, A0, P, ∑ } Vn = { A0, A1, A2, A3 } ∑ = { a, b} 4
- 5. We are generate the Production rules: 1. A -> aA1 2. A1 -> bA1 3. A1 -> aA2 4. A2 -> bA3 5. A2 -> aA2 6. A3 -> aA2 7. A3 -> bA1 8. A2 -> b 5
- 6. Thankyou 6