Regular Languages - COMP2321: Formal Languages and Finite Automata
Overview
- Formal Languages: Sets of strings over an alphabet.
- Example: Set of all strings over {a,b,c,...,z} containing an even number of 'a's and an odd number of 'b's.
- Classification of Languages: Based on patterns.
- Types include:
- Regular Languages
- Context-Free Languages
- Context-Sensitive Languages
- Recognized by different machines:
- Finite State Automaton
- Pushdown Automaton
- Linear-Bounded Automaton
Regular Languages
- Definition: A language is considered a regular language if it can be recognized by a deterministic finite automaton (DFA).
- Non-Regular Language: If no finite automaton can recognize a language L, it is termed non-regular.
- Language of a Machine (L(M)): A machine M recognizes a language L if L(M) = L.
Important Links
Additional Information
- Provided by the School of Computing.
- Content is © 2022.
This document is a part of the COMP2321 module resources provided by the School of Computing and powered by Jupyter Book. The content can be accessed in different formats such as Markdown and PDF.