Affiliation:
1. System Development Corporation, Santa Monica, California and Harvard University, Cambridge, Massachusetts
Abstract
The problem of whether a given context-free language is linear is shown to be recursively undecidable.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference8 articles.
1. R, E. On formal properties of simple phrase structure grammars. Z. Phonetik;BAR-HILLEL Y.;Sprachwiss. Kommunikationsforsch.,1961
2. On certain formal properties of grammars;CHOMSKY N;Inform. and Contr.,1959
3. On ambiguity in phrase structure languages
4. Operations Which Preserve Definability in Languages
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Context-Free Language Reachability via Skewed Tabulation;Proceedings of the ACM on Programming Languages;2024-06-20
2. Syntax checking either way;Theoretical Computer Science;2023-07
3. Syntax Checking Either Way;Implementation and Application of Automata;2022
4. Formal Grammars for Turn-Bounded Deterministic Context-Free Languages;Lecture Notes in Computer Science;2022
5. Kernels of Sub-classes of Context-Free Languages;SOFSEM 2020: Theory and Practice of Computer Science;2020