Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation

Oscar H. Ibarra, Bala Ravikumar. Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation. In Kesav V. Nori, editor, Foundations of Software Technology and Theoretical Computer Science, Seventh Conference, Pune, India, December 17-19, 1987, Proceedings. Volume 287 of Lecture Notes in Computer Science, pages 26-43, Springer, 1987.

@inproceedings{IbarraR87,
  title = {Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation},
  author = {Oscar H. Ibarra and Bala Ravikumar},
  year = {1987},
  researchr = {https://researchr.org/publication/IbarraR87},
  cites = {0},
  citedby = {0},
  pages = {26-43},
  booktitle = {Foundations of Software Technology and Theoretical Computer Science, Seventh Conference, Pune, India, December 17-19, 1987, Proceedings},
  editor = {Kesav V. Nori},
  volume = {287},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-18625-5},
}