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://doi.org/10.25596/jalc-1997-177

VOLUME 2 1997 NUMBER 3
NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets
Kai Salomaa, Sheng Yu
Pages 177–186



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-1997-177,
  author  = {Kai Salomaa and Sheng Yu},
  title   = {NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {2},
  number  = {3},
  pages   = {177--186},
  year    = {1997},
  url     = {https://doi.org/10.25596/jalc-1997-177},
  doi     = {10.25596/jalc-1997-177}
}
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, finite automata, state complexity
DOI: 10.25596/jalc-1997-177