
(Un)decidability of the finiteness and emptiness problem of some (extended) conditional tabled eco-grammar (CTEG) system language families is shown. The tiling problem is used as a tool for the undecidability proof in the case of non-extended eco-grammar systems. It is shown that forbidding CTEG systems with a forbidding context of length 2 can generate all possible tilings of the plane by Wang tiles (dominoes). The known (un)decidabi1ity results of these language families are summarized in two tables.
Journal of Automata, Languages and Combinatorics, Volume 5, Number 1, 2000, 45-58
Grammars and rewriting systems, conditional tabled eco-grammar
Grammars and rewriting systems, conditional tabled eco-grammar
| 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 |
