Automata Flashcards
1
Q
What is alphabet, Σ, in automata?
A
An alphabet is a finite set of symbols denoted by Σ in automata. Alphabets are a set of symbols used to construct a language. Example, {0, 1} is binary alphabet, {A…, Z, a… z} is the alphabet set for the English language.
2
Q
If Σ={0,1} then what does Σ ² =…?
A
{00,01,10,11}
2
Q
If Σ={0,1} then what does Σ ² =…?
A
{00,01,10,11}
3
Q
What does DFA stand foir?
A
Deterministic Finite Automaton
- For each state in DFA, there is exactly one transition for each letter of the alphabet.
4
Q
what is a tuple?
A
a data structure contain ing multiple parts
5
Q
The 5-tuple in automaton:
A
Q : Finite set of states.
Σ : set of Input Symbols.
q : Initial state.
F : set of Final States.
δ : Transition Function.
