Automaton Language



[Context Free Languages (CFLs)](https://texonom.com/context-free-languages-cfls-bdd8ae8c72de4f31b16d9b8f23d43c13)

### Template Gallery
|Title|
|:-:|
|[Template Page](https://texonom.com/template-page-8a8f1d77badb43d883b07bf4dc8ebb86)|










# Language
### Grammars defines Language
![](https://www.notion.so/image/https%3A%2F%2Fs3-us-west-2.amazonaws.com%2Fsecure.notion-static.com%2F9c69eaab-5054-412e-9454-dd14bd4b13b7%2Ftemp.jpg?table=block&id=a7dd5c56-df6c-4c0f-a9a9-a179413ad1cb&cache=v2)
← Chomsky Hierarchy
a^i : regular
a^i b^i : context-free
a^i b^i c^i
![](https://www.notion.so/image/https%3A%2F%2Fs3-us-west-2.amazonaws.com%2Fsecure.notion-static.com%2F0665b42e-7493-4745-9225-0a7a6e370ce7%2FUntitled.png?table=block&id=1d2b52ce-2ef6-4eb5-815c-37cd3cc874a3&cache=v2)
### Language is shared part so L(G) = L(R) = L(F) = L(P) = L(T) possible
> automaton and Grammar can be various but Language is unique
> two are for express Language
> Regular language only has equivalence algorithm
