Concise Representations of Regular Languages by Degree and Probabilistic Finite Automata

Chandra M. R. Kintala, Kong-Yee Pun, Detlef Wotschke. Concise Representations of Regular Languages by Degree and Probabilistic Finite Automata. Theory Comput. Syst., 26(4):379-395, 1993.

@article{KintalaPW93,
  title = {Concise Representations of Regular Languages by Degree and Probabilistic Finite Automata},
  author = {Chandra M. R. Kintala and Kong-Yee Pun and Detlef Wotschke},
  year = {1993},
  researchr = {https://researchr.org/publication/KintalaPW93},
  cites = {0},
  citedby = {0},
  journal = {Theory Comput. Syst.},
  volume = {26},
  number = {4},
  pages = {379-395},
}