Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:acta.bibl.u-szeged.hu:12578

On lexicographic enumeration of regular and context-free languages

Authors
Publication date
1 January 1997
Publisher

Abstract

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

Similar works

Full text

thumbnail-image

This paper was published in University of Szeged.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.