Splitting a context-sensitive set

DOI10.1016/S0022-0000(75)80016-XzbMath0312.68047OpenAlexW1984039494MaRDI QIDQ1219693

James C. jun. Owings

Publication date: 1975

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(75)80016-x

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

On splitting recursive sets ⋮ A short note on simultaneous splitting

Cites Work

• Relationships between nondeterministic and deterministic tape complexities
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Classes of languages and linear-bounded automata

This page was built for publication: Splitting a context-sensitive set