| Institute of Informatics>>> Acta Cybernetica>>> Past Issues>>> Volume 18, Number 1, 2007>>> |
 Magyarul
|
On monotone languages and their characterization by regular expressions
Abstract (in LaTeX format)
In one of their papers, F. G\'ecseg and B. Imreh gave a characterization for monotone string languages by regular expressions. It has turned out that the monotone string languages are exactly those languages that can be represented by finite unions of seminormal chain languages. In this paper a similar characterization is given for monotone DR-languages.
Full text
Available electronic editions: PDF.
Note that full text is available only for papers that are at least 3 years old. For more recent papers only the first page of the paper is provided.
BibTeX entry
@ARTICLE{Gyurica:2007:ActaCybernetica,author = {Gy\"orgy Gyurica},
title = {On monotone languages and their characterization by regular expressions},
journal = {Acta Cybernetica},
year = {2007},
volume = {18},
number = {1},
pages = {117--134},
abstract = {In one of their papers, F. G\'ecseg and B. Imreh gave a characterization for monotone string languages by regular expressions. It has turned out that the monotone string languages are exactly those languages that can be represented by finite unions of seminormal chain languages. In this paper a similar characterization is given for monotone DR-languages.}
}