
doi: 10.1007/bf00985825
This paper determines the necessary and sufficient condition under which a collection of sequence covers on a finite set can be induced by a surjection. The relationship of sequence covers and surjections to generalized decomposition of an automaton allowing feedback, is the same as the relationship of partitions and bijections to series-parallel decompositions. The condition determined is a natural, but complex generalization of the known condition for the series-parallel case.
Algebraic theory of languages and automata, series-parallel decompositions, surjections, collection of sequence covers
Algebraic theory of languages and automata, series-parallel decompositions, surjections, collection of sequence covers
| 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 |
