WCS-analysis of the context-sensitive

DOI10.1007/BF00289617zbMath0299.02046OpenAlexW2018908063MaRDI QIDQ1214919

P. F. Schuler

Publication date: 1975

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289617

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

Inductive definability in formal language theory

Cites Work

• Theory of Formal Systems. (AM-47)
• Degrees of Unsolvability. (AM-55)
• Unnamed Item
• Unnamed Item