299
правок
Изменения
Нет описания правки
an automation is deterministic if and only if the left languages of its states are pairwise disjoint
Если автомат <tex>\mathcal{A}</tex> распознает язык <tex>L</tex>, то автомат <tex>\operatorname{rev}(\mathcal{A})</tex> распознает <tex>\operatorname{rev}(L)</tex>(if A recognizes the language L then r(A) recognizes the language r(L))
if the left (resp. right) language of the state q in A is L_g(q)(resp. L_d(q)), then its left (resp. right) language in r(A) is L_d(q) (resp. L_g(q))
