1294
правки
Glk (обсуждение | вклад) (Новая страница: «'''Automata theory''' --- теория автоматов. In theoretical computer science, '''automata theory''' is the study of ''abstract machines'' and problem…») |
KVN (обсуждение | вклад) Нет описания правки |
||
Строка 1: | Строка 1: | ||
'''Automata theory''' | '''Automata theory''' — ''[[теория автоматов]].'' | ||
In theoretical computer science, '''automata theory''' is | In theoretical computer science, '''automata theory''' is the study of ''abstract machines'' and problems which they are able to solve. | ||
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. |