iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://unpaywall.org/10.25596/JALC-2001-453

VOLUME 6 2001 NUMBER 4
On the State Complexity of k-Entry Deterministic Finite Automata
Markus Holzer, Kai Salomaa, Sheng Yu
Pages 453–466



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2001-453,
  author  = {Markus Holzer and Kai Salomaa and Sheng Yu},
  title   = {On the State Complexity of $k$-Entry Deterministic Finite Automata},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {6},
  number  = {4},
  pages   = {453--466},
  year    = {2001},
  url     = {https://doi.org/10.25596/jalc-2001-453},
  doi     = {10.25596/jalc-2001-453}
}
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: finite automata, nondeterminism, descriptional complexity, minimization
DOI: 10.25596/jalc-2001-453