# Lecture 10: Deciding Presburger Arithmetic and WS1S Using Automata

## Motivation

## Review

We use the basic results of automata and formal languages to decide the formulas of interest.

Determinization of finite state machine

Finite state machine with epsilon transitions

Closure properties of finite state machines

Equivalence of finite state machine and regular expression languages

Automata and languages: