Minimal coverings of uniform hypergraphs and P-recursiveness

Two wide classes of hypergraphs are proved to be enumerated by P-recursive sequences. The open problem of enumerating minimal coverings that are miltipartite hypergraphs receives a qualitative-type answer.