Theory of Computation - Chapter 1: Regular Languages
0.0(0)
Studied by 0 people0.0(0)
Call with Kai
Learn
Practice Test
Spaced Repetition
Match
Flashcards
Knowt PlayCard Sorting
1/3
Earn XP
Description and Tags
Study Analytics
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No study sessions yet.
4 Terms
1
New cards
What is a finite automaton?
A computational model that has a finite number of states.
2
New cards
What’s is the formal definition of a finite automaton?
A 5-tuple list (Q, Σ, δ, q0, F) where:
Q: finite set of states
δ: Q×Σ → Q is the transition function
Σ: input alphabet
q0∈ Q: start state
F ⊆ Q: set of accept states
3
New cards
4
New cards
Note 
Flashcards (50)