A purely algebraic proof of McNaughton's theorem on infinite words - Archive ouverte HAL
Conference Papers Year : 1991

A purely algebraic proof of McNaughton's theorem on infinite words

Abstract

We give a new, purely algebraic proof of McNaughton's theorem on infinite words, which states that each recognizable set X of infinite words can be recognized by a deterministic Muller automaton. Our proof uses the semigroup approach to recognizability and relies on certain algebraic properties of finite semigroups. It also provides a simple solution to the problem of finding a deterministic automaton for X when one is given a semigroup recognizing X.
No file

Dates and versions

hal-00019923 , version 1 (01-03-2006)

Identifiers

  • HAL Id : hal-00019923 , version 1

Cite

Bertrand Le Saec, Jean-Eric Pin, Pascal Weil. A purely algebraic proof of McNaughton's theorem on infinite words. 1991, pp.141--151. ⟨hal-00019923⟩
99 View
0 Download

Share

More