RGPV 2009
Q. Construct DFA for anb | n>=0.
Ans. Some example strings = {ab, aab, aaab, aaaab}
Minimum number of states required = 2.
Construct DFA for a power n, n>=0 || RGPV TOC
RGPV 2009
Theory of computation
- Definition of DFA
- DFA notations
- How DFA process inputs
- DFA solved examples
- Minimization of DFA
- Definition of NFA
- Equivalent of DFA and NFA
- Properties of transition functions
- Trape/ Dead state
- Moore machine
- Mealy machine
- Mealy to Moore machine conversion
- Moore to Mealy machine conversion
- Difference between Mealy and Moore machine
- Regular expression
- Regular expression examples
- Regular expresstion to CFG
- Regular expression to Regular grammar
- Ambiguous grammar
- Leftmost and Rightmost derivations
- Ardens Law
- NFA with epsilon moves
- Construct NFA without epsilon moves
- NFA with epsilon to DFA Indirect method
- Context free Grammars
- Chomsky Normal Form
- Convert CFG in to CNF
- CFL are not closed under intersection
- Pushdown Automata
More subjects to read
- Cloud Computing
- Theory of Computation
- Computer Organization and Architecture
- Data Structure
- R Notes
- Software Engineering
- DBMS
- Operating Systems
- Linux
- Discrete Structure
- Computer Network
- Management Information System
- Advanced Computer Architecture
- Information Storage Management
- Network and Web Security
- Distributed System
- PHP Notes
- Web Engineering
- Python Programming
- Java Notes
- Compiler Design
- Principles of Programming Languages
Post a Comment
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.