Highly Influenced

# A Note on Deciding the Controllability of a Language K with Respect to a Language L

@inproceedings{Sreenivas1994ANO, title={A Note on Deciding the Controllability of a Language K with Respect to a Language L}, author={ControlRamavarapu S. Sreenivas}, year={1994} }

- Published 1994

If G is a plant automaton and K L(G) is a preex-closed language there exists a supervisor that is complete with respect to G such that L((j G) = K \ L(G) = K if and only if K is controllable with respect to the plant language L(G) (cf. 15]). The language K is said to controllable with respect to L(G) if and only if (i) K L, and (ii) KK u \ L(G) K, where = u c and u \ c = ;. The issue of deciding the controllability of K with respect to L(G) has been well studied in the context of nite-stateâ€¦Â CONTINUE READING

Highly Cited

This paper has 25 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

18 Citations

17 References

Similar Papers

#### References

##### Publications referenced by this paper.

Showing 1-10 of 17 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential