A theory of ultimately periodic languages and automata with an application to time granularity

    Acta Inf., pp. 331-360, 2009.

    Cited by: 4|Bibtex|Views1|Links
    EI
    Keywords:
    clinical medicineperiodic languagebasic problemautomaton-based characterizationconcrete time granularity scenarioMore(8+)

    Abstract:

    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

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments