The finite power property for context-free languages

DOI10.1016/0304-3975(81)90065-7zbMath0472.68037OpenAlexW2057884624MaRDI QIDQ1157912

Stanley M. Selkow, Charles E. Hughes

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90065-7

zbMATH Keywords

undecidability

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Constant runtime complexity of term rewriting is semi-decidable ⋮ The finite power property in free groups

Cites Work

• Unnamed Item
• Unnamed Item
• The undecidability of the Turing machine immortality problem

This page was built for publication: The finite power property for context-free languages