Q:

Smashing Seven Segments

The Setup
Consider a 5-by-5 grid of 7-segment displays, "smashed together" so that the peripheral segments of neighbouring displays overlap (see below).
           
You are given a particular grid as follows:
                                                     
The grid contains the 20 characters:
                                   
All of the characters appear in the grid, and some appear more than once. They are arranged in such a way that no two "on" (coloured) segments overlap.
For example, an A cannot appear immediately to the right of a b, but may appear immediately right of C. A 3 may not appear immediately above a q, but may appear immediately above a y.
The Challenge
Given

the coloured segments must match the given pattern
all 20 characters must be used at least once
no two coloured segments may overlap

can you determine which characters are displayed on all 25 7-segment displays?

A:

There are three valid patterns:

 EPrFA hq337 A7-L8 CP2ny b9-ed (-, 3, 7, A and P appear twice)
P2rFA Pnq37 ECELA Lhy-8 b9-ed (-, A, E, L and P appear twice)
P2rFA Pnq37 FCELA Chy-8 b9-ed (-, A, C, F and P appear twice)

Or, as graphics:

 

