Tag
Formal languages
- How Do You Recursively Define a Set of Strings?A recursive definition of strings needs an alphabet, base cases, construction rules, and a minimality clause; see a worked example.
- What Are Right- and Left-Linear Grammars?Learn how right- and left-linear grammars differ, see a worked example, and understand why each generates regular languages.
- How to Prove That a Formal Grammar Is CorrectProve grammar correctness by showing soundness and completeness: the grammar generates every intended string and no unintended strings.
- Can an NFA Reach Two Final States at the Same Time?An NFA can have multiple accepting states reachable after the same input. Acceptance requires at least one successful path, not a unique final state.