What makes some language theory problems undecidable*

https://doi.org/10.1016/S0022-0000(70)80018-6Get rights and content
Under an Elsevier user license
open archive

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.

Cited by (0)

*

This research has been supported in part by National Science Foundation Grant GJ-155and GJ-96.