article · Korean Journal of Computational & Applied Mathematics · 1999

A new algorithm of the state-minimization for the nondeterministic finite automata

Cited by 17Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Melnikov, B. (1999). A new algorithm of the state-minimization for the nondeterministic finite automata. Korean Journal of Computational & Applied Mathematics, 6(2), 277–290. https://doi.org/10.1007/bf03014374

MLA 9

Melnikov, Boris. “A new algorithm of the state-minimization for the nondeterministic finite automata.” Korean Journal of Computational & Applied Mathematics, vol. 6, no. 2, 1999, pp. 277–90, https://doi.org/10.1007/bf03014374.

Chicago

Melnikov, Boris. 1999. “A new algorithm of the state-minimization for the nondeterministic finite automata.” Korean Journal of Computational & Applied Mathematics 6 (2): 277–90. https://doi.org/10.1007/bf03014374.

Harvard

Melnikov, B. (1999) ‘A new algorithm of the state-minimization for the nondeterministic finite automata’, Korean Journal of Computational & Applied Mathematics, 6(2), pp. 277–290. Available at: https://doi.org/10.1007/bf03014374.

BibTeX

@article{melnikov1999algorithm,
  title = {{A new algorithm of the state-minimization for the nondeterministic finite automata}},
  author = {Melnikov, Boris},
  journal = {Korean Journal of Computational & Applied Mathematics},
  volume = {6},
  number = {2},
  pages = {277--290},
  year = {1999},
  doi = {10.1007/bf03014374}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.