Unusual algorithms for lexicographical enumeration

Pál Dömösi

Skip to main content Skip to main navigation menu Skip to site footer

Unusual algorithms for lexicographical enumeration

Pál Dömösi

Abstract

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.

Downloads

Download data is not yet available.

PDF

Published

2000-01-01

How to Cite

Dömösi, P. (2000). Unusual algorithms for lexicographical enumeration. Acta Cybernetica, 14(3), 461-468. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3539

Download Citation

Issue

Vol 14 No 3 (2000)

Section

Regular articles

Most read articles by the same author(s)

Pál Dömösi, Satoshi Okawa, A Chomsky-Schützenberger-Stanley type characterization of the class of slender context-free languages , Acta Cybernetica: Vol 15 No 1 (2001)
András Ádám, Pál Dömösi, Publications of László Kalmár , Acta Cybernetica: Vol 18 No 1 (2007)
Pál Dömösi, Géza Horváth, A novel cryptosystem based on Gluškov product of automata , Acta Cybernetica: Vol 22 No 2 (2015)
Pál Dömösi, Szilárd Fazekas, Masami Ito, On Chomsky Hierarchy of Palindromic Languages , Acta Cybernetica: Vol 22 No 3 (2016)
Pál Dömösi, József Gáll, Géza Horváth, Norbert Tihanyi, Statistical analysis of DH1 cryptosystem , Acta Cybernetica: Vol 23 No 1 (2017)

<< < 1 2