Feasible Algorithms for Semantics — Employing Automata and Inference Systems
dc.contributor.author | Hovland, Dag | eng |
dc.date.accessioned | 2010-11-26T13:10:31Z | |
dc.date.available | 2010-11-26T13:10:31Z | |
dc.date.issued | 2010-12-16 | eng |
dc.identifier.isbn | 978-82-308-1666-0 (print version) | en_US |
dc.identifier.uri | https://hdl.handle.net/1956/4325 | |
dc.language.iso | eng | eng |
dc.publisher | The University of Bergen | en_US |
dc.subject | Regular expressions | eng |
dc.subject | Type systems | eng |
dc.subject | Inclusion | eng |
dc.subject | Automata with counters | eng |
dc.subject | Component software | eng |
dc.subject | Numerical constraints | eng |
dc.subject | Unordered concatenation | eng |
dc.subject | 1-unambiguity | eng |
dc.subject | Strong 1-unambiguity | eng |
dc.title | Feasible Algorithms for Semantics — Employing Automata and Inference Systems | en_US |
dc.type | Doctoral thesis | |
dc.rights.holder | The author | en_US |
dc.rights.holder | Copyright the author. All rights reserved | en_US |
dc.subject.nsi | VDP::Matematikk og Naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420::Teoretisk databehandling, programmeringsspråk og -teori: 421 | nob |