Splitting a context-sensitive set (Q1219693)

From MaRDI portal

Revision as of 16:18, 12 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Splitting a context-sensitive set	scientific article

Statements

scholarly article

0 references

Splitting a context-sensitive set (English)

0 references

James C. jun. Owings

0 references

Journal of Computer and System Sciences

0 references

publication date

1975

0 references

MaRDI profile type

MaRDI publication profile

0 references

Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

0 references

Classes of languages and linear-bounded automata

0 references

Relationships between nondeterministic and deterministic tape complexities

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0022-0000(75)80016-X

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1219693

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1219693&oldid=34577613"