Automata theory: различия между версиями
Перейти к навигации
Перейти к поиску
KEV (обсуждение | вклад) Нет описания правки |
KVN (обсуждение | вклад) Нет описания правки |
||
| Строка 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. | |||
Текущая версия от 16:10, 19 декабря 2011
Automata theory — теория автоматов.
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.
Литература
- Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.