VOLUME 6 2001 NUMBER 2
State Complexity of Regular Languages
Sheng Yu
Pages 221–234



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2001-221,
  author  = {Sheng Yu},
  title   = {State Complexity of Regular Languages},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {6},
  number  = {2},
  pages   = {221--234},
  year    = {2001},
  url     = {https://doi.org/10.25596/jalc-2001-221},
  doi     = {10.25596/jalc-2001-221}
}
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: regular languages, finite languages, deterministic finite automata, state complexity, descriptional complexity
DOI: 10.25596/jalc-2001-221