On splitting recursive sets
DOI10.1016/0022-0000(78)90034-XzbMath0392.03028OpenAlexW2078845413MaRDI QIDQ1251652
Publication date: 1978
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(78)90034-x
Blum MeasuresComputational ComplexityContext-Free SetDeterministic Turing MachineFormal LanguageRecursively Enumerable SetsRegular SetSplitting Recursive Sets
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25)
Related Items (8)
Cites Work
This page was built for publication: On splitting recursive sets