Pages that link to "Item:Q4567064"
From MaRDI portal
The following pages link to Complexity of Infimal Observable Superlanguages (Q4567064):
Displaying 5 items.
- Approximation of sets of superwords by \(L\)-language formulas (Q941189) (← links)
- (Q4515265) (← links)
- New Algorithms for Verification of Relative Observability and Computation of Supremal Relatively Observable Sublanguage (Q4566940) (← links)
- The infimal controllable and N-observable superpredicate of a given predicate (Q4850257) (← links)
- Characterization of co-observable languages and formulas for their super/sublanguages (Q5274029) (← links)