# <u>An Introduction To Formal Languages And Automata, 6e</u> Solutions
###### tags: `solution`, `formal-language`, `automata`

This is the self-written solution for the exercises of *An Introduction To Formal Languages And Automata (6th edition)*, authored by Peter Linz. ==This is **NOT** the official solution, might (and definitely will) contain errors==, and is only written to record what I've done; also, HackMD is a brilliant noting platform which is also useful being able to use MathJax to render math equations.

If spotted any mistake on any piece of the solutions, or you have someting to say, feel free to leave a comment. Thanks in advance.

### Completeness:
- [x] **Chapter 1 — Introduction To The Theory of Comnputation**
- [x] 1.1 Mathematical Preliminaries and Notation
- [x] 1.2 Three Basic Concepts
- [x] 1.3 Some Applications
- [ ] **Chapter 2**
- [x] Chapter 2.1, Deterministic Finite Accepters
- [x] Chapter 2.2, Nondeterministic Finite Accepters
- [ ] Chapter 2.3, Equivalence of Deterministic And Nondeterministic Finite Accepters
- [ ] Chapter 2.4, Reduction of The Number of States In Finite Automata*
- [ ] **Chapter 3**
- [ ] **Chapter 4**
- [ ] **Chapter 5**
- [ ] **Chapter 6**
- [ ] **Chapter 7**
- [ ] **Chapter 8**
- [ ] **Chapter 9**
- [ ] **Chapter 10**
- [ ] **Chapter 11**
- [ ] **Chapter 12**
- [ ] **Chapter 13**
- [ ] **Chapter 14**