13th International Conference on Automata and Formal Languages, Debrecen, Hungary
17 August 2011 - 17 August 2011
Hungary
The 13th International Conference on Automata and Formal Languages will take place from 17 to 22 August 2011 in Debrecen, Hungary.
Automata theory is the study of abstract machines and the computational problems that can be solved using them. The field is also related to formal language theory. This is because the automata are often classified by the class of formal languages which they are able to recognise. An automaton can be a finite representation of a formal language that may be an infinite set.
Formal languages are often used as the basis for richer constructs endowed with semantics. In computer science, they are often used for the precise definition of data formats and the syntax of programming languages.
The event will be organised around a series of sessions on various topics each day.For further information, please visit: http://www.nyf.hu/afl11/(opens in new window)
Automata theory is the study of abstract machines and the computational problems that can be solved using them. The field is also related to formal language theory. This is because the automata are often classified by the class of formal languages which they are able to recognise. An automaton can be a finite representation of a formal language that may be an infinite set.
Formal languages are often used as the basis for richer constructs endowed with semantics. In computer science, they are often used for the precise definition of data formats and the syntax of programming languages.
The event will be organised around a series of sessions on various topics each day.For further information, please visit: http://www.nyf.hu/afl11/(opens in new window)