VOLUME 7 2002 NUMBER 3

Semiring Frameworks and Algorithms for Shortest-Distance Problems
Mehryar Mohri
Pages 321–350





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2002-321,
  author  = {Mehryar Mohri},
  title   = {Semiring Frameworks and Algorithms for Shortest-Distance Problems},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {7},
  number  = {3},
  pages   = {321--350},
  year    = {2002},
  url     = {https://doi.org/10.25596/jalc-2002-321},
  doi     = {10.25596/jalc-2002-321}
}
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: semirings, finite automata, shortest-pathsalgorithms, rational power series
DOI: 10.25596/jalc-2002-321