Logic and Automata Introduction

Strings and languages

Finite state machine

Determinization of finite state machine

Finite state machine with epsilon transitions

Closure properties of finite state machines

Regular expression

Equivalence of finite state machine and regular expression languages

Regular expressions for automata with parallel inputs

Using automata to decide Presburger arithmetic

MSOL over strings

Automata and languages:

• Introduction to the Theory of Computation
• Introduction to Automata Theory, Languages, and Computation

MSOL:

• The MONA Project

More

• LASH Toolset
• Constraint solving and decision problems of first-order theories of concrete domains, by Ralf Treinen

Verification of linked structures using automata or MSOL:

• Field constraint analysis
• Pointer Assertion Logic Engine

MSOL:

• Tree Automata Techniques and Applications (Tata book)
• The MONA Project
• Timbook for Reachability Analysis and Tree Automata Calculations

Last year:

• sav07_lecture_15
• sav07_lecture_16
• sav07_lecture_17