benchmarks.wiki

benchmarks.wiki / Public workspace

MMLU-Pro / 10552 / For all strings x, the function x^M is defined recursively as follows.

Problem

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

question

For all strings x, the function x^M is defined recursively as follows.
e^M= e, and
if w is a string and a is a string with length 1, then
(aw)^M = aw^Ma.
Let a be a string with length 1, and let x and y be arbitrary strings. Which of the following is true?

category

computer science

options

  1. a^M = a
  2. (ax)^M = (xa)^M
  3. (xy)^M = y^Mx^M
  4. None of the above

src

ori_mmlu-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

upstream_id / Original problem ID
10552
task_id
a2097a93-950b-552c-b580-9ff4b8c751eb
task_key
default--test--10552
task_revision_id
1
config / split
default / test

Official source

initial import