论文信息 - What makes Some Language Theory Problems Undecidable

What makes Some Language Theory Problems Undecidable

In the theory of automata and formal languages, the undecidability of various properties has been studied for specific classes of languages. Here we abstract the essence of various proofs of undecidability and find wide classes of properties and general conditions on families of languages such that these proofs of undecidability hold. The paper also illustrates the manner in which the degree of undecidability of a property changes as we consider more and more complicated families of languages.

Juris Hartmanis | John E. Hopcroft

[1] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

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

[3] Juris Hartmanis,et al. Structure of Undecidable Problems in Automata Theory , 1968, SWAT.

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

[5] M. Minsky. Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[6] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

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