Current Science

The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


ω-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.

Keywords

Büchi Automata, Co-Buchi Automata and Muller Automata, Rabin Automata, Streett Automata.
User
Notifications
Font Size