About this document
Finite State Automata Operations Explained by moggabor is a document available to read on EtoBox.
The document discusses operations on finite state automata including union, intersection, and complementation. It provides examples of applying these operations to automata over the alphabet {a,b}. Determinization of a non-deterministic automaton is described as a way to complement it, though this results in exponential size increase. Safety properties can be checked by constructing the product automaton of the system model and specification and checking for empty language. Examples are given of modeling a
- Author
- moggabor
- Language
- EN