ML Anthology

Finding Redundant Constraints for FSM Minimization

Lin Yuan, Pushkin R. Pari, Gang Qu
AAAI 2004 pp. 976-977
/aaai/2004/yuan2004aaai-finding/

Abstract

Finite state machine (FSM) is a computation model that consists of a finite set of states, a start state, an input alphabet, and a transition function that defines the next state and/or outputs based on the current state and input symbols.

PDF AAAI Semantic Scholar

Cite

Text

Yuan et al. "Finding Redundant Constraints for FSM Minimization." AAAI Conference on Artificial Intelligence, 2004.

Markdown

[Yuan et al. "Finding Redundant Constraints for FSM Minimization." AAAI Conference on Artificial Intelligence, 2004.](https://mlanthology.org/aaai/2004/yuan2004aaai-finding/)

BibTeX

@inproceedings{yuan2004aaai-finding,
  title     = {{Finding Redundant Constraints for FSM Minimization}},
  author    = {Yuan, Lin and Pari, Pushkin R. and Qu, Gang},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2004},
  pages     = {976-977},
  url       = {https://mlanthology.org/aaai/2004/yuan2004aaai-finding/}
}