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]](https://bibbase.org/img/filetypes/link.svg "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
{"_id":"GMvHnhEs8W7KXvnvt","bibbaseid":"maler-pnueli-tightboundsonthecomplexityofcascadeddecompositionofautomata-1990","downloads":0,"creationDate":"2015-07-05T11:05:40.331Z","title":"Tight Bounds on the Complexity of Cascaded Decomposition of Automata","author_short":["Maler, O.","Pnueli, A."],"year":1990,"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/focs/MalerP90","bibdata":{"title":"Tight Bounds on the Complexity of Cascaded Decomposition of Automata","author":["Oded Maler","Amir Pnueli"],"author_short":["Maler, O.","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)","bibtex":"@inproceedings{ dblp4415086,\n title = {Tight Bounds on the Complexity of Cascaded Decomposition of Automata},\n author = {Oded Maler and Amir Pnueli},\n author_short = {Maler, O. and Pnueli, A.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {1990},\n key = {dblp4415086},\n id = {dblp4415086},\n biburl = {http://www.dblp.org/rec/bibtex/conf/focs/MalerP90},\n url = {http://dx.doi.org/10.1109/FSCS.1990.89589},\n conference = {FOCS},\n pages = {672-682},\n text = {FOCS 1990:672-682},\n booktitle = {Proceedings of Foundations of Computer Science (FOCS)}\n}","bibbaseid":"maler-pnueli-tightboundsonthecomplexityofcascadeddecompositionofautomata-1990","role":"author","urls":{"Paper":"http://dx.doi.org/10.1109/FSCS.1990.89589"},"downloads":0},"search_terms":["tight","bounds","complexity","cascaded","decomposition","automata","maler","pnueli"],"keywords":[],"authorIDs":[],"dataSources":["ewMfj9NdxqigEfe5t"]}