On lexicographic enumeration of regular and context-free languages
We show that it is possible to efficiently enumerate the words of a regular language in lexicographic order. The time needed for generating the next word is O(n) when enumerating words of length n. We also define a class of context-free languages for which efficient enumeration is possible.
Elmentve itt :
| Szerző: | |
|---|---|
| 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/12578 |
| LEADER | 01045nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta12578 | ||
| 005 | 20220613151918.0 | ||
| 008 | 161015s1997 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Mäkinen Erkki | |
| 245 | 1 | 3 | |a On lexicographic enumeration of regular and context-free languages |h [elektronikus dokumentum] / |c Mäkinen Erkki |
| 260 | |c 1997 | ||
| 300 | |a 55-61 | ||
| 490 | 0 | |a Acta cybernetica |v 13 No. 1 | |
| 520 | 3 | |a We show that it is possible to efficiently enumerate the words of a regular language in lexicographic order. The time needed for generating the next word is O(n) when enumerating words of length n. We also define a class of context-free languages for which efficient enumeration is possible. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12578/1/cybernetica_013_numb_001_055-061.pdf |z Dokumentum-elérés |