Automaton Relation


# Relation
Regular expression determines regular language / FAs - Lexical analysis
Context Free Grammar determines context free language - PDAs - syntax analysis
language terminal set is only one but RE, FAs, CFG, PDAs can be various
FA instance is one computation model, TM instance is one program
### Automaton Relation Notion
|Title|
|:-:|
|[Halting Problem](https://texonom.com/halting-problem-ef95f2638ef64fbba522eeb23a2e9002)|
|[Rice's theorem](https://texonom.com/rices-theorem-40258a56e57945c9a76fd088180093e0)|









