Complexity of right-ideal, prefix-closed, and prefix-free regular languages
A language L over an alphabet Σ is prefix-convex if, for any words x, y, z ϵ Σ* , whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free languages as special cases. We examine complexity properties of these special prefix-convex langua...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2017
|
| Sorozat: | Acta cybernetica
23 No. 1 |
| Kulcsszavak: | Kibernetika - nyelvészet, Matematikai nyelvészet |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.23.1.2017.3 |
| Online Access: | http://acta.bibl.u-szeged.hu/50061 |