Reduction Techniques for Finite (Tree) Automata
Finite automata appear in almost every branch of computer science, for example in model checking, in natural language processing and in database theory. In many applications where finite automata occur, it is highly desirable to deal with automata that are as small as possible, in order to save memo...
| Main Author: | |
|---|---|
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
Uppsala universitet, Avdelningen för datorteknik
2008
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-9330 http://nbn-resolving.de/urn:isbn:978-91-554-7313-6 |