context-free language

Show Summary Details

Quick Reference

Any formal language generated by a context-free grammar or, equivalently from another viewpoint, any formal language recognized by a pushdown automaton. It can also be characterized as the frontier of a regular tree language, or as generated by term algebras (see initial algebra).

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.