Unusual algorithms for lexicographical enumeration
Using well-known results, we consider algorithms for finding minimal words of given length n in regular and context-free languages. We also show algorithms enumerating the words of given length n of regular and contextfree languages in lexicographical order.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Published: |
2000
|
| Series: | Acta cybernetica
14 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Algoritmus |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12638 |
| Summary: | Using well-known results, we consider algorithms for finding minimal words of given length n in regular and context-free languages. We also show algorithms enumerating the words of given length n of regular and contextfree languages in lexicographical order. |
|---|---|
| Physical Description: | 461-468 |
| ISSN: | 0324-721X |