On lexicographic enumeration of regular and context-free languages

Mäkinen Erkki: On lexicographic enumeration of regular and context-free languages. In: Acta cybernetica, (13) 1. pp. 55-61. (1997)

[thumbnail of cybernetica_013_numb_001_055-061.pdf]
Cikk, tanulmány, mű

Download (543kB) | Preview


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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 1997
Volume: 13
Number: 1
ISSN: 0324-721X
Page Range: pp. 55-61
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38503/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: 61. p. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:26
Last Modified: 2022. Jun. 13. 15:19
URI: http://acta.bibl.u-szeged.hu/id/eprint/12578

Actions (login required)

View Item View Item