VOLUME 9 2004 NUMBERS 2–3
The Maximum State Complexity for Finite Languages
Cezar Câmpeanu, Wing Hong Ho
Pages 189–202



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2004-189,
  author  = {Cezar C{\^{a}}mpeanu and Wing Hong Ho},
  title   = {The Maximum State Complexity for Finite Languages},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {9},
  number  = {2--3},
  pages   = {189--202},
  year    = {2004},
  url     = {https://doi.org/10.25596/jalc-2004-189},
  doi     = {10.25596/jalc-2004-189}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: formal languages, regular languages, finite automata, finite languages, state-complexity, descriptional complexity
DOI: 10.25596/jalc-2004-189