Theoretical Computer Science · 1982 · 65 citations · 2 references
Natural SciencesComputer ScienceMathematicsCombinatoricsGraph ColoringGraph TheoryGrammar Theory
Graphs, regarded as grammar forms as well as coloring specifications, induce graph-families, so-called color-families. In this paper a minimal producer-graph for every color-family is introduced and as the main result it is shown that color-families are dense, in the sense that between any two families one can ‘squeeze in’ another one.
2
On predecessors of finite languages
Hermann Maurer, Arto Salomaa, Derick Wood · Information and Control · 1981 · 10 citations