benchmarks.wiki

benchmarks.wiki / Public workspace

MMLU / Let A and B be two sets of words (strings) from Σ*, for some alphabet of symbols…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

question

Let A and B be two sets of words (strings) from Σ*, for some alphabet of symbols Σ. Suppose that B is a subset of A. Which of the following statements must always be true of A and B ?
I. If A is finite, then B is finite.
II. If A is regular, then B is regular.
III. If A is context-free, then B is context-free.

choices

  1. I only
  2. II only
  3. III only
  4. I and II only

subject

college_computer_science

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

task_id
f0aab7bd-5bb3-5215-8eef-3cad14fd5a4f
task_key
all--test--f0aab7bd-5bb3-5215-8eef-3cad14fd5a4f
task_revision_id
1
config / split
all / test

Official source

initial import