Facts
Citation
URLhttps://en.wikipedia.org/wiki/Greibach%27s_theorem
Sources
Greibach's theorem, Wikipedia
Lead sectionQuote, Lead section
In theoretical computer science, in particular in formal language theory, Greibach's theorem states that certain properties of formal language classes are undecidable.
Claims Backed By This Source (8 claims)
This source backs 8 claims across the atlas. As facts: 4 well-attested. As cited relationships: 2 holds. Plus 2 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Theorems, 7 claims: 3 well-attested, 2 holds, 2 general references.
- Sources, 1 claims: 1 well-attested.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.