A theory of ultimately periodic languages and automata with an application to time granularity
Acta Inf., pp. 331-360, 2009.
clinical medicineperiodic languagebasic problemautomaton-based characterizationconcrete time granularity scenarioMore(8+)
In this paper, we develop a theory of regular ω-languages that consist of ultimately periodic words only and we provide it with an automaton-based characterization. The resulting class of automata, called ultimately periodic automata (UPA), is a subclass of the class of Büchi automata and inherits some properties of automata over finite w...More
Full Text (Upload PDF)
PPT (Upload PPT)