Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Unpublished Work
%1 Xu2009
%A Xu, Yingjie
%D Unpublished-2009
%K automata_minimization hopcroft automata finite_automata formal_languages Computation_Theory
%T Describing an n log n algorithm for minimizing states in deterministic finite automaton
@unpublished{Xu2009,
added-at = {2011-04-18T16:03:35.000+0200},
author = {Xu, Yingjie},
biburl = {https://www.bibsonomy.org/bibtex/21d4483dd8ed62f44a729abe6270c2f21/diego},
file = {Article:Xu2009.pdf:PDF},
interhash = {64f4e8f8e41346cd047ff25a1e33ec68},
intrahash = {1d4483dd8ed62f44a729abe6270c2f21},
keywords = {automata_minimization hopcroft automata finite_automata formal_languages Computation_Theory},
month = {January},
timestamp = {2011-05-12T22:30:33.000+0200},
title = {Describing an n log n algorithm for minimizing states in deterministic finite automaton},
year = {\emph{Unpublished-2009}}
}