Formal languages, regular expressions, and finite automata basics from an intro discrete mathematics course.
29 cards · basic cards · AI-written, checked twice. Edit anything.
- What is a formal alphabet?
- A finite, non-empty set of symbols, usually denoted Σ, used to form strings in a formal language.
- Define a string (or word) over an alphabet Σ.
- A finite sequence of symbols from Σ, written consecutively without spaces or punctuation.
- Define a formal language.
- A set of strings over a given alphabet, where each string is a finite sequence of symbols from that alphabet.
- What is the Kleene star (L*) of a language L?
- The set of all strings formed by concatenating zero or more strings from L, including the empty string.
- What is the union of two languages L1 and L2?
- The set of all strings that belong to either L1 or L2 (or both), denoted L1 ∪ L2.
- What is the concatenation of two languages L1 and L2?
- The set of all strings formed by concatenating a string from L1 with a string from L2, denoted L1·L2 or L1L2.
- What is a regular language?
- A language that can be recognized by a finite automaton, or equivalently, a language that can be described by a regular expression.
- What is a deterministic finite automaton (DFA)?
- A finite state machine where each state has exactly one transition for each input symbol, and it accepts or rejects a string based on whether it ends in an accepting state.
- What is a nondeterministic finite automaton (NFA)?
- A finite state machine where a state may have zero, one, or multiple transitions for the same input symbol, or epsilon transitions that require no input.
- In the context of finite automata, what is a state?
- A node in the automaton that represents a configuration or memory of the machine during its operation.
- What is a transition function in a finite automaton?
- A function δ(q, a) that maps a state q and input symbol a to a next state (or set of states in an NFA), or is undefined if no transition exists.
- What is an accepting state (or final state) in a finite automaton?
- A designated state from which, if the automaton arrives at it after reading the entire input string, the string is accepted by the automaton.
- What is the start state of a finite automaton?
- The designated initial state where the automaton begins processing an input string, usually denoted q0.
- What does it mean for a string to be accepted by a DFA?
- The string is accepted if, starting from the start state and following transitions for each symbol in the string, the DFA ends in an accepting state.
- What is the key property of transitions in a DFA?
- For each state and each input symbol, there is exactly one outgoing transition, making the next state unique and deterministic.
FlashKeepers