A note on undecidable properties of formal languages |
| |
| Authors: | Sheila Greibach |
| |
| Affiliation: | (1) Harvard University, USA;(2) System Development Corporation, USA |
| |
| Abstract: | A general set of conditions is given under which a property is undecidable for a family of languages. Examples are given of the application of this result to wellknown families of languages.Research sponsored in part by the Air Force cambridge Research Laboratories, Office of Aerospace Research, USAF, under Contract F1962867C0008, and by the Air Force Office of Scientific Research, Office of Aerospace Research, USAF under Grant No. AF-AFOSR-1203-67. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
