Very Special Languages and Representations of Recursively Enumerable Languages via Computation Histories
暂无分享,去创建一个
[1] Grzegorz Rozenberg,et al. Developmental systems and languages , 1972, STOC.
[2] Arto Salomaa,et al. On the Decidability of Homomorphism Equivalence for Languages , 1978, J. Comput. Syst. Sci..
[3] Gerald A. Fischer,et al. On the Representation of Formal Languages Using Automata on Networks , 1969, SWAT.
[4] Brenda S. Baker,et al. Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..
[5] Andrew Chi-Chih Yao,et al. K + 1 heads are better than K , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[6] Seymour Ginsburg,et al. On AFL Generators for Finitely Encoded AFA , 1973, J. Comput. Syst. Sci..
[7] Andrzej Ehrenfeucht,et al. On the Emptiness of the Intersection of Two D0S Languages Problem , 1980, Inf. Process. Lett..
[8] Arnold L. Rosenberg. On multi-head finite automata , 1965, SWCT.
[9] Tom Head,et al. The Decidability of Equivalence for Deterministic Finite Transducers , 1979, J. Comput. Syst. Sci..
[10] Seymour Ginsburg,et al. Principal AFL , 1970, J. Comput. Syst. Sci..
[11] Joost Engelfriet,et al. Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages , 1980, JACM.
[12] John C. Shepherdson,et al. Computability of Recursive Functions , 1963, JACM.