Citation Hunt

Leaderboard

The Wikipedia snippet below is not backed by a reliable source. Can you find one?

Click I got this! to go to Wikipedia and fix the snippet, or Next! to see another one. Good luck!

In page Turing completeness:

This text has been unreferenced on Wikipedia for a very long time. If you can't find a source, be bold and remove it!

"

Many computational languages exist that are not Turing-complete. One such example is the set of regular languages, which are generated by regular expressions and which are recognized by finite automata. A more powerful but still not Turing-complete extension of finite automata is the category of pushdown automata and context-free grammars, which are commonly used to generate parse trees in an initial stage of program compiling. Further examples include some of the early versions of the pixel shader languages embedded in Direct3D and OpenGL extensions.[citation needed]