Server problems and regular languages
The sequences of requests are considered as words over the alphabet of vertices. We assume that the server problem is restricted, meaning that the request words are chosen from a subset of all possible words, i.e. from a language. We define the class ONLINE consisting of the languages, for which the...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1997
|
| Sorozat: | Acta cybernetica
13 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12576 |