Generalized fairness and context-free languages
The notion of fairness for generalized shuffle operations was introduced in [10]. The n-fairness property requires, roughly speaking, that in any prefix of a word the difference of the numbers of occurrences of two symbols is at most n. Here we give a new simplified proof for the decidability of uni...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1999
|
| Sorozat: | Acta cybernetica
14 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12619 |
| Tartalmi kivonat: | The notion of fairness for generalized shuffle operations was introduced in [10]. The n-fairness property requires, roughly speaking, that in any prefix of a word the difference of the numbers of occurrences of two symbols is at most n. Here we give a new simplified proof for the decidability of uniform n-fairness for context-free languages. Also, we show that the more general, linear or logarithmic, fairness notions are decidable. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 193-203 |
| ISSN: | 0324-721X |