Degrees of Unsolvability in Formal Grammars

DOI10.1145/321479.321490zbMath0169.31202OpenAlexW2074223891MaRDI QIDQ5556435

Dennis Frank Cudia, W. E. Singletary

Publication date: 1968

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321479.321490

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (4)

The many-one equivalence of some general combinatorial decision problems ⋮ Decision problems for tag systems ⋮ UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES ⋮ Theory of formal grammars

This page was built for publication: Degrees of Unsolvability in Formal Grammars