1 / 56

# Algorithms for hard problems Automata and tree automata - PowerPoint PPT Presentation

Algorithms for hard problems Automata and tree automata. Juris Viksna, 2013. Finite deterministic automata. initial state. accepting state. transition. state. [Adapted from P.Drineas]. Finite deterministic automata. Finite Automaton (FA). : set of states. : input alphabet.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'Algorithms for hard problems Automata and tree automata' - terrel

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

Automata and

tree automata

Juris Viksna, 2013

initial

state

accepting

state

transition

state

Finite Automaton (FA)

: set of states

: input alphabet

: transition function d: Q×S  Q

: initial state

: set of accepting states

L(M) = set of all words accepted by M

A word is accepted by NFA, if there exists an accepting path from

the initial state to a final state

Set of states, i.e.

Input aplhabet, i.e.

Transition function d: Q×(S)  P(Q)

Initial state

Accepting states

L(M) = set of all words accepted by M

• the class of languages accepted by NFAs with -transitions is the same as the class of languages accepted by NFAs without -transitions

• the class of languages accepted by NFAs is the same as the class of languages accepted by DFAs

0,1

0,1

q3

1

q4

q1

q2

1

0,e

Nondeterministic finite automaton M

0

q010

q110

q000

q100

0

0

1

0

1

1

0

0

1

0

1

q011

q111

q001

q101

1

1

Deterministic finite automaton equivalent to M

1

Nondeterministic finite automaton M

Corresponding deterministic

finite automaton M

NDF with  transitions

Corresponding NDF without  transitions

M.Fellows]

A right regular grammar is a formal grammar (N, Σ, P, S) such that all

the production rules in P are of one of the following forms:

A → a - where A is a non-terminal in N and a is a terminal in Σ

A → aB - where A and B are in N and a is in Σ

A → ε - where A is in N and ε denotes the empty string,

i.e. the string of length 0.

In a left regular grammar all rules obey the forms:

A → a - where A is a non-terminal in N and a is a terminal in Σ

A → Ba - where A and B are in N and a is in Σ

A → ε - where A is in N and ε is the empty string.

Both right and left grammars generate regular languages