论文信息 - Relationships between AFDL's and Cylinders - 字舞流文

Relationships between AFDL's and Cylinders

Jean-Michel Autebert | Jean-Michel Autebert

[1] W. J. Chandler. Abstract families of deterministic languages , 1969, STOC.

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

[3] Sheila A. Greibach,et al. The Hardest Context-Free Language , 1973, SIAM J. Comput..

[4] Sheila A. Greibach,et al. Jump PDA's and Hierarchies of Deterministic Context-Free Languages , 1974, SIAM J. Comput..

[5] Maurice Nivat,et al. Transduction des langages de Chomsky , 1968 .

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

[7] Seymour Ginsburg,et al. On the Largest Full SubAFL of an AFL , 1972, Math. Syst. Theory.

[8] Seymour Ginsburg,et al. Studies In Abstract Families Of Languages , 1969 .

[9] Seymour Ginsburg,et al. Principal AFL , 1970, J. Comput. Syst. Sci..

[10] Jorge E. Mezei,et al. On Relations Defined by Generalized Finite Automata , 1965, IBM J. Res. Dev..