Regular languages classification
Languages are generated by grammar rules. Noah Chomsky proposed a formal Grammar hierarchy, which is related with Automatas classification.
- Type 0: All formal grammars - turing machine
- Type 1: Context sensitive grammars - linear bounded automaton
- Type 2: Context free grammar - pushdown automaton
- Type 3: Regular Grammar - finite state automaton
(See wikipedia)
Natural languages
As far as I know, natural languages doesn't fit in Chomsky hierarchy. But I'm sure that if there is a automaton that can handle a natural language, it must be as powerful as a turing machine. However, there is a lot of special semantic ambiguity that must be resolved by the surrounding context, or must be learned previously (more info).
Remaining cuestions
- Does a theoy that understand the interaction between natural and formal languages exists?
- Esperanto is defined as a constructed language. It has the same meaning that formal language?