Thesis
Weak cost automata over infinite trees
- Abstract:
-
Cost automata are traditional finite state automata enriched with a finite set of counters that can be manipulated on each transition. Based on the evolution of counter values, a cost automaton defines a function from the set of structures under consideration to the natural numbers extended with infinity, modulo a boundedness relation that ignores exact values but preserves boundedness properties.
Historically, variants of cost automata have been used to solve problems in language th...
Expand abstract
Actions
Bibliographic Details
- Publication date:
- 2012
- Type of award:
- DPhil
- Level of award:
- Doctoral
- Awarding institution:
- Oxford University, UK
Item Description
- Language:
- English
- Keywords:
- Subjects:
- UUID:
-
uuid:16c6de98-545f-4d2d-acda-efc040049452
- Local pid:
- ora:6774
- Deposit date:
- 2013-03-21
Terms of use
- Copyright holder:
- Vanden Boom, M
- Copyright date:
- 2012
If you are the owner of this record, you can report an update to it here: Report update to this record