AUTOMATA Flashcards

1
Q

What is a finite automata?

A

a machine that develops languages and processes symbols from an alphabet into strings

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is the most common form of DFA?

A

Deterministic finite automata

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What are the states of an automata?

A

Q values (each checkpoint of an automata)W

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the start state?

A

The first state, usually identified by an arrow pointing into from nothing.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is the final/accepting state?

A

The end states for automaton, usually identified by 2 circles around state.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is the transition function?

A

Takes in input state and input symbol to produce an output.
e.g. δ: Q X Σ > Q
also done mathmatically through
δ(Q3,b) = Q3 or δ(Q0,a) = Q1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What are the rules for DFA?

A
  • ONE start state
  • ONE OR MORE accepting states
  • at MOST one outgoing transition from each state FOR EACH SYMBOL
  • NO REQUIREMENT that accepting states are reachable
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How is language derived from automata?

A

Assume M is a finite automata, L(M) is all strings u over Σ satisfying the transition q0 (u)–> q
where q0 is start state and q is accepting state
e.g. ig u is string, u = a,a2,a3,a4,a5..an
and q0 > q1 > q2 > … > qn
STATES CAN REPEAT

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

How to move on from states?

A

Must continue unless accepting state if exists another symbol to go down,

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is a non-deterministic automata (NFA)?

A

Allows same state and symbol to transition to more than one output

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is the transition function for non-deterministic automata?

A

Δ: Q X Σ > P(Q)

range of transition function is a subset of Q so is powerset of Q ( set of sets of Q)
e.g. if q0 can go multiple directions from symbol b, then mathematically it transitions Δ(q0,b) = {q1,q2} ( A SET!)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is the empty tranition?

A

Denoted as NFA^ε
Allows transitions to move to new state without consuming symbol
Called ε steps (epsilon stems)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is the transition function for NFA^ε?

A

Δ: Q X (Σ ∪ {ε}) > P(Q)
Shows that symbol step could be empty string ε
ε makes no increase as it is a unit for concatenation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What does a,b or a,ε mean for symbol transitions?

A

It can be either value for each step
e.g. if a,b
then the transition could be Δ(q1,b) = q2
or Δ(q1,a) = q2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly