article · 2004

A Practical Algorithm for Reducing Nondeterministic Finite State Automata

Michael Albert, S. Linton, Michael Albert A, Steve Linton B

Cited by 4Abstract and details only

Abstract

In [3], Ilie and Yu describe a construction of a right-invariant equivalence relation on the states of a non-deterministic finite-state automaton. We give a more e#- cient algorithm for constructing the same equivalence, together with results from a computer implementation.

Cite this paper

APA 7

Albert, M., Linton, S., A, M. A., & B, S. L. (2004). A Practical Algorithm for Reducing Nondeterministic Finite State Automata.

MLA 9

Albert, Michael, et al. “A Practical Algorithm for Reducing Nondeterministic Finite State Automata.” 2004.

Chicago

Albert, Michael, S. Linton, Michael Albert A, and Steve Linton B. 2004. “A Practical Algorithm for Reducing Nondeterministic Finite State Automata.”

Harvard

Albert, M. et al. (2004) ‘A Practical Algorithm for Reducing Nondeterministic Finite State Automata’.

BibTeX

@article{albert2004practical,
  title = {{A Practical Algorithm for Reducing Nondeterministic Finite State Automata}},
  author = {Albert, Michael and Linton, S. and A, Michael Albert and B, Steve Linton},
  year = {2004}
}

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