Kozen Automata And Computability
Rylan Powlowski-Daugherty
—
computability in terms of fixed-point computations and provide tools for verifying properties of computational systems. What is the significance of fixed-point theory in Kozen automata? Fixed-point theory is central to Kozen automata because it allows the cha
