Unusual algorithms for lexicographical enumeration

Authors

  • 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.

Downloads

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

Issue

Vol. 14 No. 3 (2000)

Section

Regular articles

Most read articles by the same author(s)

1 2 > >>