Omega Automata and its Classes
Natasha Singh, Ajay Kumar · Current Science · 2018
ω-automata is a variant of finite automata which accepts infinite strings.It represents the behaviour of the infinite systems (hardware, operating system and control systems) which are not expected to end.A variety of conditions are used to represent the set of accepting strings in ω-automata.This paper summarizes various types of ω-automata, their transition functions and accepting conditions.In addition, this paper also summarizes the applicability of omega automata in various interdisciplinary fields.