VOLUME 7 2002 NUMBER 4

Descriptional Complexity of Finite Automata: Concepts and Open Problems
Juraj Hromkovič
Pages 519–531





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2002-519,
  author  = {Juraj Hromkovi{\v{c}}},
  title   = {Descriptional Complexity of Finite Automata: Concepts and Open Problems},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {7},
  number  = {4},
  pages   = {519--531},
  year    = {2002},
  url     = {https://doi.org/10.25596/jalc-2002-519},
  doi     = {10.25596/jalc-2002-519}
}
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: automata, regular languages, descriptional complexity
DOI: 10.25596/jalc-2002-519