
In this report we show that, for each alphabet Σ, there exists a context-free grammar G which satisfies the property that for each context-free language L ⊆ Σ* a regular control set C can be found such that LC(G) = L.
Formal languages and automata, Engineering(all)
Formal languages and automata, Engineering(all)
| 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). | 11 | |
| 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). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
