Characterizations of transductions defined by abstract families of transducers
暂无分享,去创建一个
[1] Oscar H. Ibarra,et al. Multi-Tape and Multi-Head Pushdown Automata , 1968, Inf. Control..
[2] Alfred V. Aho,et al. A general theory of translation , 1969, Mathematical systems theory.
[3] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .
[4] Sheila A. Greibach,et al. An Infinite Hierarchy of Context-Free Languages , 1969, JACM.
[5] J. Hopcroft,et al. An Approach to a Unified Theory of Automata , 1967, SWAT.
[6] Alfred V. Aho,et al. A Characterization of Two-Way Deterministic Classes of Languages , 1970, J. Comput. Syst. Sci..
[7] Seymour Ginsburg,et al. Operations Which Preserve Definability in Languages , 1963, JACM.
[8] Seymour Ginsburg,et al. Abstract Families of Languages , 1967, SWAT.
[9] Seymour Ginsburg,et al. Preservation of Languages by Transducers , 1966, Inf. Control..
[10] Alfred V. Aho,et al. A Characterization of Two-Way Deterministic Classes of Languages , 1969, J. Comput. Syst. Sci..
[11] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..
[12] Seymour Ginsburg,et al. One-way stack automata , 1967, JACM.
[13] Jeffrey D. Ullman,et al. An Approach to a Unified Theory of Automata , 1967, SWAT.
[14] W. J. Chandler. Abstract families of deterministic languages , 1969, STOC.
[15] Jorge E. Mezei,et al. On Relations Defined by Generalized Finite Automata , 1965, IBM J. Res. Dev..