Weighted automata as coalgebras in categories of matrices
The evolution from non-deterministic to weighted automata represents a shift from qual- itative to quantitative methods in computer science. The trend calls for a language able to reconcile quantitative reasoning with formal logic and set theory, which have for so many years supported qualitative re...
| Main Author: | |
|---|---|
| Format: | article |
| Language: | eng |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1822/24651 |
| Country: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/24651 |