Greibach's theorem
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.
known for
primaryTopic
Greibach's theorem
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.
has abstract
In theoretical computer scienc ...... , who first proved it in 1963.
@en
Wikipage page ID
42,138,836
Wikipage revision ID
694,367,767
subject
comment
In theoretical computer scienc ...... , who first proved it in 1963.
@en
label
Greibach's theorem
@en