Tight Bounds on the Complexity of Cascaded Decomposition of Automata. Maler, O. & Pnueli, A. In Proceedings of Foundations of Computer Science (FOCS), pages 672-682, 1990.
Tight Bounds on the Complexity of Cascaded Decomposition of Automata [link]Paper  bibtex   
@inproceedings{ dblp4415086,
  title = {Tight Bounds on the Complexity of Cascaded Decomposition of Automata},
  author = {Oded Maler and Amir Pnueli},
  author_short = {Maler, O. and Pnueli, A.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {1990},
  key = {dblp4415086},
  id = {dblp4415086},
  biburl = {http://www.dblp.org/rec/bibtex/conf/focs/MalerP90},
  url = {http://dx.doi.org/10.1109/FSCS.1990.89589},
  conference = {FOCS},
  pages = {672-682},
  text = {FOCS 1990:672-682},
  booktitle = {Proceedings of Foundations of Computer Science (FOCS)}
}
Downloads: 0