LARA

Lecture 15: Decision Procedure for WS1S

Weak Monadic Logic of One Successor

Review

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

Connection between WS1S and Automata

Regular expressions for automata with parallel inputs

Using Automata to Decide WS1S

Remarks on WS1S Complexity

Expressing finite automata in MSOL over strings

Tree automata

References: