CHESMIN: A Heuristic for State Reduction in Incompletely Specified Finite State Machines. Gören, S. & Ferguson, F. J. In DATE, pages 248-254, 2002. IEEE Computer Society.
CHESMIN: A Heuristic for State Reduction in Incompletely Specified Finite State Machines. [link]Link  CHESMIN: A Heuristic for State Reduction in Incompletely Specified Finite State Machines. [link]Paper  bibtex   
@inproceedings{conf/date/GorenF02,
  added-at = {2017-05-23T00:00:00.000+0200},
  author = {Gören, Sezer and Ferguson, F. Joel},
  biburl = {https://www.bibsonomy.org/bibtex/204e55f4775a50cf4fa6db8b0259e3d6a/dblp},
  booktitle = {DATE},
  crossref = {conf/date/2002},
  ee = {http://dl.acm.org/citation.cfm?id=874442},
  interhash = {46112ceb4fb69e4ab3d642348074ddec},
  intrahash = {04e55f4775a50cf4fa6db8b0259e3d6a},
  isbn = {0-7695-1471-5},
  keywords = {dblp},
  pages = {248-254},
  publisher = {IEEE Computer Society},
  timestamp = {2019-10-17T15:04:56.000+0200},
  title = {CHESMIN: A Heuristic for State Reduction in Incompletely Specified Finite State Machines.},
  url = {http://dblp.uni-trier.de/db/conf/date/date2002.html#GorenF02},
  year = 2002
}

Downloads: 0