user10160382
Reputation:
Drawing a DFA for L= { a^n b^n , n>0}
Could someone explain how to do this? This is homework and I'm fairly new when it comes to programming.
Upvotes: 0
Views: 2250
Answers (1)
Patrick87
Reputation: 28312
This is not a regular language and therefore there is no DFA which accepts it. You can prove this using the pumping lemma or the Myhill-Nerode theorem.
Upvotes: 1
Related Questions
- Turing machine for language L={a^m b^n a^m b^n ∣ m,n≥0}
- Deterministic Pushdown Automata for L = a^nb^n | n >=0) Python Program
- Are there any steps or rules to draw a DFA?
- Trying to Build DFA
- Design a turing machine that accepts the language L= {a^2 b^2n: n>=1}
- Creating a DFA from : x^a y^b x^a
- drawing minmal DFA for the given regular expression
- Deterministic Finite Automata state diagram
- How to design a DFA for the following language?
- Drawing a simple non-deterministic finite automaton (NFA)