论文信息 - Abstract Families of Languages

Abstract Families of Languages

The notion of an abstract family of languages (AFL) as a family of sets of words satisfying certain properties common to many types of formal languages is introduced. Operations preserving AFL are then considered. The concept of an abstract family of acceptors (AFA) is also introduced and shown to give rise to an AFL. A necessary and sufficient condition on an AFL is presented in order that the AFL come from some AFA. Finally, abstract families of transducers (AFA with output) are discussed.

Seymour Ginsburg | Sheila A. Greibach | S. Ginsburg | S. Greibach

[1] Seymour Ginsburg,et al. Stack automata and compiling , 1967, JACM.

[2] S.-Y. Kuroda,et al. Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..

[3] Peter S. Landweber,et al. Three Theorems on Phrase Structure Grammars of Type 1 , 1963, Inf. Control..

[4] Seymour Ginsburg,et al. Mappings which Preserve Context Sensitive Languages , 1966, Inf. Control..

[5] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

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

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

[8] Seymour Ginsburg,et al. Preservation of Languages by Transducers , 1966, Inf. Control..

[9] C. C. Elgot. Decision problems of finite automata design and related arithmetics , 1961 .