Unusual algorithms for lexicographical enumeration

Dömösi Pál: Unusual algorithms for lexicographical enumeration. In: Acta cybernetica, (14) 3. pp. 461-468. (2000)

[thumbnail of cybernetica_014_numb_003_461-468.pdf]
Cikk, tanulmány, mű

Download (569kB) | Preview


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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2000
Volume: 14
Number: 3
ISSN: 0324-721X
Page Range: pp. 461-468
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38509/
Uncontrolled Keywords: Számítástechnika, Kibernetika, Algoritmus
Additional Information: Bibliogr.: 468. p. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 14. 10:50
URI: http://acta.bibl.u-szeged.hu/id/eprint/12638

Actions (login required)

View Item View Item