Automata theory: различия между версиями

Перейти к навигации Перейти к поиску
Нет описания правки
Нет описания правки
 
Строка 3: Строка 3:
In theoretical computer science, '''automata theory''' is the study of ''abstract machines'' and problems which they are able to solve.
In theoretical computer science, '''automata theory''' is the study of ''abstract machines'' and problems which they are able to solve.
'''Automata theory''' is closely related to ''[[formal language theory]]'' as the automata are often classified by the class of ''formal languages'' they are able to recognize.
'''Automata theory''' is closely related to ''[[formal language theory]]'' as the automata are often classified by the class of ''formal languages'' they are able to recognize.
==Литература==
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.