We give a concise introduction to the coalgebraic theory of Moore machines, and building on [6], develop a method for constructing a final Moore machine based on a simple modal logic. Completeness for the logic follows easily from the finality construction, and we furthermore show how this logical framework can be used for machine learning.
| Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:QMM.111602 |
| Date | January 2008 |
| Creators | Cordy, Brendan. |
| Publisher | McGill University |
| Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
| Language | English |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Format | application/pdf |
| Coverage | Master of Science (Department of Mathematics and Statistics.) |
| Rights | All items in eScholarship@McGill are protected by copyright with all rights reserved unless otherwise indicated. |
| Relation | alephsysno: 003134973, proquestno: AAIMR66905, Theses scanned by UMI/ProQuest. |
Page generated in 0.0021 seconds