Advertisement

ω-Automata

  • Berndt Farwer
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2500)

Abstract

Automata on infinite words have gained a great deal of importance since their first definition some forty years ago. Apart from the interests from a theoretical point of view they have practical importance for the specification and verification of reactive systems that are not supposed to terminate at some point of time. Operating systems are an example of such systems, as they should be ready to process any user input as it is entered, without terminating after or during some task.

Keywords

Expressive Power Regular Language Transition Graph Acceptance Condition Input Word 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Berndt Farwer
    • 1
  1. 1.Fachbereich InformatikUniversität HamburgGermany

Personalised recommendations