An introduction to timed languages and timed automata
College of Computer Studies
Timed languages are introduced as a class of languages that accepts timed words: sequences of events wherein each event is associated with a certain time of occurrence. To model timed regular languages, timed automata must be used. These are extensions of finite automata wherein each occurs fulfilling a certain time constraint in addition to the input event. This paper introduces the concepts of timed languages, timed automata, their properties, operations and applications in modeling real-time systems.
Obach, D., Jamoralin, K., Ong, A. L., & Ong, R. (2005). An introduction to timed languages and timed automata. Retrieved from https://animorepository.dlsu.edu.ph/faculty_research/8585
Sequential machine theory
Undated; publication/creation date supplied