McNaughton's theorem

Mikołaj Bojańczyk · ACM SIGLOG News · 2015

In the logic and automata community, Robert McNaughton is perhaps best known for his determinisation result for automata on infinite words, as mentioned in the obituary. Below, I try to explain the significance of this result.

Read the paper · More papers on PaperTik