
In this paper monotone string and monotone tree languages are studied. For the string case, the monotone languages are characterized by means of regular expressions and syntactic monoids. Tree languages recognized by monotone frontier-to-root and monotone root-to-frontier recognizers are also characterized by syntactic monoids
Journal of Automata, Languages and Combinatorics, Volume 7, Number 1, 2002, 71-82
monotone tree languages, Formal languages and automata, monotone string
monotone tree languages, Formal languages and automata, monotone string
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
