VOLUME 9 2004 NUMBERS 2–3

Tradeoffs Between Reliability and Conciseness of Deterministic Finite Automata
Martin Kappes, Chandra M. R. Kintala
Pages 281–292





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2004-281,
  author  = {Martin Kappes and Chandra M. R. Kintala},
  title   = {Tradeoffs Between Reliability and Conciseness of Deterministic Finite Automata},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {9},
  number  = {2--3},
  pages   = {281--292},
  year    = {2004},
  url     = {https://doi.org/10.25596/jalc-2004-281},
  doi     = {10.25596/jalc-2004-281}
}
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: software reliability, finite automata, descriptional complexity
DOI: 10.25596/jalc-2004-281