Abstract families of deterministic languages
William J. Chandler · 1969
Abstract families of (one-way) deterministic acceptors are formalized and shown to be characterized by families of languages closed under marked union, marked *, and inverse marked gsm mapping. The independence of these closure operations is also proved.