FOSSACS   2011 International Conference on Foundations of Software Science and Computation Structure
Wall of Fame | Most Viewed FOSSACS-2011 Paper
11 years 9 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source226
2Download preprint from source205
3Download preprint from source201
4Download preprint from source198
5Download preprint from source190
6Download preprint from source169
7Download preprint from source163