Journal of the ACM (JACM)
Formal languages and their relation to automata
Formal languages and their relation to automata
Structure of undecidable problems in automata theory
SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
Reachability and Safety in Queue Systems
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Journal of Computer and System Sciences
Substitution and bounded languages
Journal of Computer and System Sciences
Polynomial generators of recursively enumerable languages
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
| Hi-index | 0.00 |
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.