Greibach's theorem
id:
greibach-s-theorem-292-14058190
title:
Greibach's theorem
text:
In theoretical computer science, in particular in formal language theory, Greibach's theorem states that certain properties of formal language classes are undecidable. It is named after the computer scientist Sheila Greibach, who first proved it in 1963.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Greibach%27s_theorem
date created:
date modified:
2023-08-18T22:43:19Z
main entity:
{"identifier":"Q17019301","url":"https://www.wikidata.org/entity/Q17019301"}
image:
fields total:
13
integrity:
13