论文信息 - Abstract families of deterministic languages

Abstract families of deterministic languages

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.

W. J. Chandler

[1] J. Hopcroft,et al. An Approach to a Unified Theory of Automata , 1967, SWAT.

[2] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .

[3] Seymour Ginsburg,et al. Abstract Families of Languages , 1967, SWAT.

[4] Seymour Ginsburg,et al. Deterministic Context Free Languages , 1965, Inf. Control..

[5] S. Ginsburg,et al. Finite-Turn Pushdown Automata , 1966 .

[6] Seymour Ginsburg,et al. One-way stack automata , 1967, JACM.